/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.04.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:10:29,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:10:29,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:10:30,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:10:30,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:10:30,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:10:30,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:10:30,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:10:30,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:10:30,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:10:30,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:10:30,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:10:30,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:10:30,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:10:30,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:10:30,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:10:30,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:10:30,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:10:30,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:10:30,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:10:30,076 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:10:30,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:10:30,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:10:30,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:10:30,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:10:30,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:10:30,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:10:30,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:10:30,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:10:30,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:10:30,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:10:30,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:10:30,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:10:30,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:10:30,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:10:30,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:10:30,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:10:30,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:10:30,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:10:30,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:10:30,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:10:30,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:10:30,103 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:10:30,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:10:30,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:10:30,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 16:10:30,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 16:10:30,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 16:10:30,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 16:10:30,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 16:10:30,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 16:10:30,137 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 16:10:30,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:10:30,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:10:30,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:10:30,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:10:30,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:10:30,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:10:30,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:10:30,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:10:30,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:10:30,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:10:30,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:10:30,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:10:30,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:10:30,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:10:30,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:10:30,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:10:30,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:10:30,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 16:10:30,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 16:10:30,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:10:30,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 16:10:30,142 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 16:10:30,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 16:10:30,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 16:10:30,143 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:10:30,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:10:30,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:10:30,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:10:30,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:10:30,416 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:10:30,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-07 16:10:30,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39496c8d4/1b8e9f08d20e4a3bbfb5344f6adb1b71/FLAGa74db7f56 [2022-04-07 16:10:31,016 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:10:31,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-07 16:10:31,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39496c8d4/1b8e9f08d20e4a3bbfb5344f6adb1b71/FLAGa74db7f56 [2022-04-07 16:10:31,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39496c8d4/1b8e9f08d20e4a3bbfb5344f6adb1b71 [2022-04-07 16:10:31,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:10:31,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 16:10:31,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:10:31,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:10:31,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:10:31,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:10:31" (1/1) ... [2022-04-07 16:10:31,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae3ef52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:31, skipping insertion in model container [2022-04-07 16:10:31,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:10:31" (1/1) ... [2022-04-07 16:10:31,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:10:31,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:10:31,951 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.04.i.cil-2.c[65405,65418] [2022-04-07 16:10:31,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:10:31,982 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:10:32,093 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.04.i.cil-2.c[65405,65418] [2022-04-07 16:10:32,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:10:32,113 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:10:32,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32 WrapperNode [2022-04-07 16:10:32,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:10:32,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:10:32,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:10:32,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:10:32,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (1/1) ... [2022-04-07 16:10:32,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (1/1) ... [2022-04-07 16:10:32,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (1/1) ... [2022-04-07 16:10:32,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (1/1) ... [2022-04-07 16:10:32,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (1/1) ... [2022-04-07 16:10:32,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (1/1) ... [2022-04-07 16:10:32,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (1/1) ... [2022-04-07 16:10:32,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:10:32,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:10:32,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:10:32,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:10:32,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (1/1) ... [2022-04-07 16:10:32,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:10:32,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:10:32,276 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:10:32,278 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:10:32,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:10:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:10:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:10:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-07 16:10:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-07 16:10:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:10:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-07 16:10:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-07 16:10:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 16:10:32,314 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-07 16:10:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:10:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:10:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:10:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:10:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-07 16:10:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 16:10:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 16:10:32,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-07 16:10:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-07 16:10:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-07 16:10:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-07 16:10:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-07 16:10:32,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:10:32,451 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:10:32,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:10:34,016 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 16:10:34,554 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-07 16:10:34,554 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-07 16:10:34,566 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:10:34,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:10:34,575 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:10:34,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:10:34 BoogieIcfgContainer [2022-04-07 16:10:34,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:10:34,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:10:34,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:10:34,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:10:34,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:10:31" (1/3) ... [2022-04-07 16:10:34,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f11b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:10:34, skipping insertion in model container [2022-04-07 16:10:34,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:32" (2/3) ... [2022-04-07 16:10:34,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f11b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:10:34, skipping insertion in model container [2022-04-07 16:10:34,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:10:34" (3/3) ... [2022-04-07 16:10:34,584 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2022-04-07 16:10:34,588 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:10:34,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:10:34,629 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:10:34,635 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:10:34,635 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:10:34,656 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:10:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 16:10:34,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:34,662 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:10:34,663 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-07 16:10:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:34,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683554976] [2022-04-07 16:10:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:35,286 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:10:35,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-07 16:10:35,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-07 16:10:35,289 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:10:35,289 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:10:35,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-07 16:10:35,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-07 16:10:35,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-07 16:10:35,290 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:10:35,291 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:10:35,294 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:10:35,294 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:10:35,296 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:10:35,296 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:10:35,297 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:10:35,298 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:10:35,298 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:10:35,298 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:10:35,299 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:10:35,299 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:10:35,299 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:10:35,299 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:10:35,300 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:10:35,300 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:10:35,300 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:10:35,300 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:10:35,301 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:10:35,301 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:10:35,301 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:10:35,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-07 16:10:35,301 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:10:35,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-07 16:10:35,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-07 16:10:35,303 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:10:35,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:35,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683554976] [2022-04-07 16:10:35,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683554976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:35,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:35,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869000330] [2022-04-07 16:10:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:35,311 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:10:35,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:35,318 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:10:35,359 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:10:35,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:35,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:35,383 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:10:37,437 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:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:38,786 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-07 16:10:38,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:38,790 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:10:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:38,791 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:10:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-07 16:10:38,805 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:10:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-07 16:10:38,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-07 16:10:39,193 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:10:39,203 INFO L225 Difference]: With dead ends: 267 [2022-04-07 16:10:39,204 INFO L226 Difference]: Without dead ends: 122 [2022-04-07 16:10:39,206 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:10:39,209 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:39,210 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.5s Time] [2022-04-07 16:10:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-07 16:10:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-07 16:10:39,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:39,242 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:10:39,243 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:10:39,243 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:10:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:39,249 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-07 16:10:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-07 16:10:39,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:39,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:39,251 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:10:39,252 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:10:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:39,257 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-07 16:10:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-07 16:10:39,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:39,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:39,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:39,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:39,259 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:10:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-07 16:10:39,265 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-07 16:10:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:39,266 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-07 16:10:39,266 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:10:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-07 16:10:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 16:10:39,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:39,274 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:10:39,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:10:39,274 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-07 16:10:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:39,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549995671] [2022-04-07 16:10:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:39,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:39,533 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:10:39,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-07 16:10:39,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-07 16:10:39,535 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:10:39,535 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:10:39,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-07 16:10:39,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-07 16:10:39,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#true} call #t~ret158 := main(); {855#true} is VALID [2022-04-07 16:10:39,536 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:10:39,537 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:10:39,538 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:10:39,539 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:10:39,539 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:10:39,541 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:10:39,544 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:10:39,545 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:10:39,545 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:10:39,545 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:10:39,546 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:10:39,546 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:10:39,547 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:10:39,547 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:10:39,548 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:10:39,548 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:10:39,549 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:10:39,549 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:10:39,549 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:10:39,550 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:10:39,550 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:10:39,551 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:10:39,551 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:10:39,552 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:10:39,552 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:10:39,552 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:10:39,553 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:10:39,553 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:10:39,554 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:10:39,554 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:10:39,555 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:10:39,555 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:10:39,556 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:10:39,556 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:10:39,557 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:10:39,557 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:10:39,558 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:10:39,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {856#false} is VALID [2022-04-07 16:10:39,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-04-07 16:10:39,559 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:10:39,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:39,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549995671] [2022-04-07 16:10:39,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549995671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:39,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:39,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:39,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606444473] [2022-04-07 16:10:39,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:39,562 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:10:39,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:39,562 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:10:39,605 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:10:39,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:39,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:39,607 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:10:41,627 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:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:42,438 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-07 16:10:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:42,439 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:10:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:42,447 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:10:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-07 16:10:42,454 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:10:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-07 16:10:42,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-07 16:10:42,867 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:42,877 INFO L225 Difference]: With dead ends: 327 [2022-04-07 16:10:42,877 INFO L226 Difference]: Without dead ends: 222 [2022-04-07 16:10:42,878 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:42,882 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:42,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:10:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-07 16:10:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-07 16:10:42,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:42,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:42,912 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:42,913 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:42,922 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-07 16:10:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-07 16:10:42,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:42,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:42,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-07 16:10:42,926 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-07 16:10:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:42,935 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-07 16:10:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-07 16:10:42,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:42,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:42,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:42,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-07 16:10:42,946 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-07 16:10:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:42,946 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-07 16:10:42,947 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:10:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-07 16:10:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-07 16:10:42,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:42,950 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:10:42,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:10:42,951 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-07 16:10:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:42,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898408140] [2022-04-07 16:10:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:43,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {1952#true} is VALID [2022-04-07 16:10:43,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1952#true} assume true; {1952#true} is VALID [2022-04-07 16:10:43,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1952#true} {1952#true} #593#return; {1952#true} is VALID [2022-04-07 16:10:43,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {1952#true} call ULTIMATE.init(); {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:43,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {1959#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {1952#true} is VALID [2022-04-07 16:10:43,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {1952#true} assume true; {1952#true} is VALID [2022-04-07 16:10:43,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1952#true} {1952#true} #593#return; {1952#true} is VALID [2022-04-07 16:10:43,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {1952#true} call #t~ret158 := main(); {1952#true} is VALID [2022-04-07 16:10:43,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:10:43,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {1952#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1952#true} is VALID [2022-04-07 16:10:43,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:10:43,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:10:43,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:10:43,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {1952#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1952#true} is VALID [2022-04-07 16:10:43,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {1952#true} assume !false; {1952#true} is VALID [2022-04-07 16:10:43,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:10:43,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {1952#true} assume 12292 == #t~mem49;havoc #t~mem49; {1952#true} is VALID [2022-04-07 16:10:43,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:10:43,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:10:43,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {1952#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1952#true} is VALID [2022-04-07 16:10:43,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {1952#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:10:43,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:10:43,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {1952#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1952#true} is VALID [2022-04-07 16:10:43,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {1952#true} assume !(0 == ~tmp___4~0); {1952#true} is VALID [2022-04-07 16:10:43,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:10:43,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:10:43,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {1952#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1952#true} is VALID [2022-04-07 16:10:43,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {1952#true} ~skip~0 := 0; {1952#true} is VALID [2022-04-07 16:10:43,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {1952#true} assume !false; {1952#true} is VALID [2022-04-07 16:10:43,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {1952#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); {1952#true} is VALID [2022-04-07 16:10:43,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {1952#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:10:43,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {1952#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:10:43,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {1952#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:10:43,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {1952#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:10:43,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {1952#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-07 16:10:43,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {1952#true} assume 4368 == #t~mem54;havoc #t~mem54; {1952#true} is VALID [2022-04-07 16:10:43,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {1952#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; {1952#true} is VALID [2022-04-07 16:10:43,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {1952#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1952#true} is VALID [2022-04-07 16:10:43,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {1952#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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {1957#(= 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; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {1957#(= 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; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {1957#(= 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); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:43,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {1957#(= 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); {1958#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-07 16:10:43,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {1958#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:10:43,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {1953#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:10:43,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {1953#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:10:43,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {1953#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:10:43,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {1953#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:10:43,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {1953#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-07 16:10:43,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {1953#false} assume 4432 == #t~mem62;havoc #t~mem62; {1953#false} is VALID [2022-04-07 16:10:43,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {1953#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1953#false} is VALID [2022-04-07 16:10:43,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {1953#false} assume 5 == ~blastFlag~0; {1953#false} is VALID [2022-04-07 16:10:43,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {1953#false} assume !false; {1953#false} is VALID [2022-04-07 16:10:43,198 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:10:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:43,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898408140] [2022-04-07 16:10:43,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898408140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:43,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:43,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558015439] [2022-04-07 16:10:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:43,199 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:10:43,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:43,200 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:10:43,258 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:10:43,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:43,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:43,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:43,259 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:45,286 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:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:46,378 INFO L93 Difference]: Finished difference Result 362 states and 537 transitions. [2022-04-07 16:10:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:46,379 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:10:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:46,379 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:10:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-07 16:10:46,384 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:10:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-07 16:10:46,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-07 16:10:46,683 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:10:46,688 INFO L225 Difference]: With dead ends: 362 [2022-04-07 16:10:46,688 INFO L226 Difference]: Without dead ends: 257 [2022-04-07 16:10:46,689 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:46,690 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:46,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-07 16:10:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2022-04-07 16:10:46,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:46,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,701 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,701 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:46,710 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-07 16:10:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-07 16:10:46,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:46,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:46,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-07 16:10:46,712 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-07 16:10:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:46,721 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-07 16:10:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-07 16:10:46,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:46,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:46,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:46,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-07 16:10:46,730 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-07 16:10:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:46,730 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-07 16:10:46,730 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:10:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-07 16:10:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 16:10:46,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:46,731 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:10:46,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 16:10:46,732 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:46,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 2 times [2022-04-07 16:10:46,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:46,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236275562] [2022-04-07 16:10:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:46,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:46,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {3181#true} is VALID [2022-04-07 16:10:46,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {3181#true} assume true; {3181#true} is VALID [2022-04-07 16:10:46,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3181#true} {3181#true} #593#return; {3181#true} is VALID [2022-04-07 16:10:46,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {3181#true} call ULTIMATE.init(); {3188#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:46,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {3181#true} is VALID [2022-04-07 16:10:46,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {3181#true} assume true; {3181#true} is VALID [2022-04-07 16:10:46,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3181#true} {3181#true} #593#return; {3181#true} is VALID [2022-04-07 16:10:46,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {3181#true} call #t~ret158 := main(); {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {3181#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; {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L272 TraceCheckUtils]: 6: Hoare triple {3181#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {3181#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); {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {3181#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; {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {3181#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; {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {3181#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {3181#true} assume !false; {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {3181#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); {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {3181#true} assume 12292 == #t~mem49;havoc #t~mem49; {3181#true} is VALID [2022-04-07 16:10:46,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {3181#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; {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {3181#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {3181#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {3181#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {3181#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); {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {3181#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {3181#true} assume !(0 == ~tmp___4~0); {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {3181#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); {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {3181#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); {3181#true} is VALID [2022-04-07 16:10:46,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {3181#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3181#true} is VALID [2022-04-07 16:10:46,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {3181#true} ~skip~0 := 0; {3181#true} is VALID [2022-04-07 16:10:46,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {3181#true} assume !false; {3181#true} is VALID [2022-04-07 16:10:46,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {3181#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); {3181#true} is VALID [2022-04-07 16:10:46,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {3181#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-07 16:10:46,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {3181#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-07 16:10:46,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {3181#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-07 16:10:46,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {3181#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-07 16:10:46,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {3181#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-07 16:10:46,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {3181#true} assume 4368 == #t~mem54;havoc #t~mem54; {3181#true} is VALID [2022-04-07 16:10:46,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {3181#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; {3181#true} is VALID [2022-04-07 16:10:46,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {3181#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3181#true} is VALID [2022-04-07 16:10:46,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {3181#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); {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:46,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {3186#(= 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; {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:46,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {3186#(= 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); {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:46,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(= 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; {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:46,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:46,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:46,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {3186#(= 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); {3187#(= |ssl3_connect_#t~mem49| 4384)} is VALID [2022-04-07 16:10:46,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {3187#(= |ssl3_connect_#t~mem49| 4384)} assume 12292 == #t~mem49;havoc #t~mem49; {3182#false} is VALID [2022-04-07 16:10:46,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {3182#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; {3182#false} is VALID [2022-04-07 16:10:46,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {3182#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {3182#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3182#false} is VALID [2022-04-07 16:10:46,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {3182#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {3182#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); {3182#false} is VALID [2022-04-07 16:10:46,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {3182#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3182#false} is VALID [2022-04-07 16:10:46,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {3182#false} assume !(0 == ~tmp___4~0); {3182#false} is VALID [2022-04-07 16:10:46,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {3182#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); {3182#false} is VALID [2022-04-07 16:10:46,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {3182#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); {3182#false} is VALID [2022-04-07 16:10:46,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {3182#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3182#false} is VALID [2022-04-07 16:10:46,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {3182#false} ~skip~0 := 0; {3182#false} is VALID [2022-04-07 16:10:46,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2022-04-07 16:10:46,975 INFO L290 TraceCheckUtils]: 55: Hoare triple {3182#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); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {3182#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {3182#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {3182#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {3182#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {3182#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {3182#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {3182#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {3182#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {3182#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {3182#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {3182#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,977 INFO L290 TraceCheckUtils]: 67: Hoare triple {3182#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {3182#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-07 16:10:46,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {3182#false} assume 4432 == #t~mem62;havoc #t~mem62; {3182#false} is VALID [2022-04-07 16:10:46,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {3182#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {3182#false} is VALID [2022-04-07 16:10:46,977 INFO L290 TraceCheckUtils]: 71: Hoare triple {3182#false} assume 5 == ~blastFlag~0; {3182#false} is VALID [2022-04-07 16:10:46,977 INFO L290 TraceCheckUtils]: 72: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2022-04-07 16:10:46,977 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:10:46,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:46,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236275562] [2022-04-07 16:10:46,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236275562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:46,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:46,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:46,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096860880] [2022-04-07 16:10:46,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:46,982 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:10:46,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:46,983 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:10:47,043 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:10:47,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:47,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:47,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:47,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:47,045 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,075 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:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,073 INFO L93 Difference]: Finished difference Result 379 states and 565 transitions. [2022-04-07 16:10:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:50,073 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:10:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:50,073 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:10:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-07 16:10:50,079 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:10:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-07 16:10:50,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-07 16:10:50,383 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:50,388 INFO L225 Difference]: With dead ends: 379 [2022-04-07 16:10:50,388 INFO L226 Difference]: Without dead ends: 256 [2022-04-07 16:10:50,389 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:50,389 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 37 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:50,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 484 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-07 16:10:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2022-04-07 16:10:50,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:50,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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:10:50,400 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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:10:50,401 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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:10:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,408 INFO L93 Difference]: Finished difference Result 256 states and 376 transitions. [2022-04-07 16:10:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2022-04-07 16:10:50,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:50,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:50,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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 256 states. [2022-04-07 16:10:50,410 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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 256 states. [2022-04-07 16:10:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,417 INFO L93 Difference]: Finished difference Result 256 states and 376 transitions. [2022-04-07 16:10:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2022-04-07 16:10:50,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:50,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:50,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:50,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 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:10:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 355 transitions. [2022-04-07 16:10:50,425 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 355 transitions. Word has length 73 [2022-04-07 16:10:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:50,425 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 355 transitions. [2022-04-07 16:10:50,426 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:10:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 355 transitions. [2022-04-07 16:10:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 16:10:50,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:50,427 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:10:50,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 16:10:50,427 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:50,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-07 16:10:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:50,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663127292] [2022-04-07 16:10:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:50,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:50,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {4432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {4425#true} is VALID [2022-04-07 16:10:50,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {4425#true} assume true; {4425#true} is VALID [2022-04-07 16:10:50,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4425#true} {4425#true} #593#return; {4425#true} is VALID [2022-04-07 16:10:50,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {4425#true} call ULTIMATE.init(); {4432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:50,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {4432#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {4425#true} is VALID [2022-04-07 16:10:50,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {4425#true} assume true; {4425#true} is VALID [2022-04-07 16:10:50,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4425#true} {4425#true} #593#return; {4425#true} is VALID [2022-04-07 16:10:50,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {4425#true} call #t~ret158 := main(); {4425#true} is VALID [2022-04-07 16:10:50,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {4425#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; {4425#true} is VALID [2022-04-07 16:10:50,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {4425#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4425#true} is VALID [2022-04-07 16:10:50,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {4425#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); {4425#true} is VALID [2022-04-07 16:10:50,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {4425#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; {4425#true} is VALID [2022-04-07 16:10:50,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {4425#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; {4425#true} is VALID [2022-04-07 16:10:50,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {4425#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4425#true} is VALID [2022-04-07 16:10:50,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {4425#true} assume !false; {4425#true} is VALID [2022-04-07 16:10:50,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {4425#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); {4425#true} is VALID [2022-04-07 16:10:50,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {4425#true} assume 12292 == #t~mem49;havoc #t~mem49; {4425#true} is VALID [2022-04-07 16:10:50,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {4425#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; {4425#true} is VALID [2022-04-07 16:10:50,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {4425#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4425#true} is VALID [2022-04-07 16:10:50,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {4425#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4425#true} is VALID [2022-04-07 16:10:50,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {4425#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4425#true} is VALID [2022-04-07 16:10:50,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {4425#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); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {4425#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {4425#true} assume !(0 == ~tmp___4~0); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {4425#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); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {4425#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); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {4425#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {4425#true} ~skip~0 := 0; {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {4425#true} assume !false; {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {4425#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); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {4425#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {4425#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {4425#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {4425#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-07 16:10:50,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {4425#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-07 16:10:50,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {4425#true} assume 4368 == #t~mem54;havoc #t~mem54; {4425#true} is VALID [2022-04-07 16:10:50,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {4425#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; {4425#true} is VALID [2022-04-07 16:10:50,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {4425#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4425#true} is VALID [2022-04-07 16:10:50,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {4425#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); {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:50,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {4430#(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; {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:50,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {4430#(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); {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:50,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {4430#(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; {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:50,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:50,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:50,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {4430#(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); {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:50,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {4430#(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); {4431#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-07 16:10:50,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {4431#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {4426#false} is VALID [2022-04-07 16:10:50,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {4426#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {4426#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4426#false} is VALID [2022-04-07 16:10:50,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {4426#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {4426#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); {4426#false} is VALID [2022-04-07 16:10:50,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {4426#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4426#false} is VALID [2022-04-07 16:10:50,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {4426#false} assume !(0 == ~tmp___4~0); {4426#false} is VALID [2022-04-07 16:10:50,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {4426#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); {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 51: Hoare triple {4426#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); {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {4426#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {4426#false} ~skip~0 := 0; {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {4426#false} assume !false; {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {4426#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); {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {4426#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {4426#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {4426#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 59: Hoare triple {4426#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,681 INFO L290 TraceCheckUtils]: 60: Hoare triple {4426#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {4426#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {4426#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {4426#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {4426#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 65: Hoare triple {4426#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {4426#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {4426#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {4426#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {4426#false} assume 4432 == #t~mem62;havoc #t~mem62; {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {4426#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {4426#false} assume 5 == ~blastFlag~0; {4426#false} is VALID [2022-04-07 16:10:50,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {4426#false} assume !false; {4426#false} is VALID [2022-04-07 16:10:50,684 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:10:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:50,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663127292] [2022-04-07 16:10:50,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663127292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:50,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:50,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704472731] [2022-04-07 16:10:50,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:50,686 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:10:50,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:50,687 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:10:50,753 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:10:50,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:50,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:50,754 INFO L87 Difference]: Start difference. First operand 240 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:10:52,782 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:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:53,817 INFO L93 Difference]: Finished difference Result 647 states and 966 transitions. [2022-04-07 16:10:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:53,818 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:10:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:53,818 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:10:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-07 16:10:53,822 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:10:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-07 16:10:53,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-07 16:10:54,165 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:10:54,177 INFO L225 Difference]: With dead ends: 647 [2022-04-07 16:10:54,177 INFO L226 Difference]: Without dead ends: 423 [2022-04-07 16:10:54,178 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:54,179 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:10:54,179 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:10:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-07 16:10:54,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 264. [2022-04-07 16:10:54,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:54,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,192 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,193 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:54,205 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2022-04-07 16:10:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2022-04-07 16:10:54,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:54,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:54,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-07 16:10:54,208 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-07 16:10:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:54,221 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2022-04-07 16:10:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2022-04-07 16:10:54,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:54,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:54,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:54,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 390 transitions. [2022-04-07 16:10:54,229 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 390 transitions. Word has length 73 [2022-04-07 16:10:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:54,229 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 390 transitions. [2022-04-07 16:10:54,229 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:10:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 390 transitions. [2022-04-07 16:10:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-07 16:10:54,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:54,230 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:10:54,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 16:10:54,231 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-07 16:10:54,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:54,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525025207] [2022-04-07 16:10:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:54,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:54,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:54,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {6350#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {6343#true} is VALID [2022-04-07 16:10:54,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-07 16:10:54,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6343#true} {6343#true} #593#return; {6343#true} is VALID [2022-04-07 16:10:54,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {6343#true} call ULTIMATE.init(); {6350#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:54,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {6350#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {6343#true} is VALID [2022-04-07 16:10:54,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-07 16:10:54,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6343#true} {6343#true} #593#return; {6343#true} is VALID [2022-04-07 16:10:54,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {6343#true} call #t~ret158 := main(); {6343#true} is VALID [2022-04-07 16:10:54,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {6343#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; {6343#true} is VALID [2022-04-07 16:10:54,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {6343#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {6343#true} is VALID [2022-04-07 16:10:54,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {6343#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); {6343#true} is VALID [2022-04-07 16:10:54,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {6343#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; {6343#true} is VALID [2022-04-07 16:10:54,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {6343#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; {6343#true} is VALID [2022-04-07 16:10:54,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {6343#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6343#true} is VALID [2022-04-07 16:10:54,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {6343#true} assume !false; {6343#true} is VALID [2022-04-07 16:10:54,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {6343#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); {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {6343#true} assume 12292 == #t~mem49;havoc #t~mem49; {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {6343#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; {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {6343#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {6343#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {6343#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {6343#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); {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {6343#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {6343#true} assume !(0 == ~tmp___4~0); {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {6343#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); {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {6343#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); {6343#true} is VALID [2022-04-07 16:10:54,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {6343#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {6343#true} ~skip~0 := 0; {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {6343#true} assume !false; {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {6343#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); {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {6343#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {6343#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {6343#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {6343#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {6343#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {6343#true} assume 4368 == #t~mem54;havoc #t~mem54; {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {6343#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; {6343#true} is VALID [2022-04-07 16:10:54,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {6343#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {6343#true} is VALID [2022-04-07 16:10:54,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {6343#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); {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:54,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {6348#(= 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; {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:54,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {6348#(= 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); {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:54,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {6348#(= 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; {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:54,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:54,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:54,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {6348#(= 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); {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:54,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {6348#(= 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); {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:54,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {6348#(= 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); {6349#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-07 16:10:54,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {6349#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {6344#false} is VALID [2022-04-07 16:10:54,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {6344#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {6344#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6344#false} is VALID [2022-04-07 16:10:54,460 INFO L290 TraceCheckUtils]: 47: Hoare triple {6344#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {6344#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); {6344#false} is VALID [2022-04-07 16:10:54,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {6344#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {6344#false} assume !(0 == ~tmp___4~0); {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {6344#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); {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {6344#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); {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {6344#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {6344#false} ~skip~0 := 0; {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {6344#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); {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {6344#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {6344#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,466 INFO L290 TraceCheckUtils]: 59: Hoare triple {6344#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {6344#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {6344#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {6344#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {6344#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {6344#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {6344#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,469 INFO L290 TraceCheckUtils]: 66: Hoare triple {6344#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,471 INFO L290 TraceCheckUtils]: 67: Hoare triple {6344#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {6344#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,472 INFO L290 TraceCheckUtils]: 69: Hoare triple {6344#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-07 16:10:54,472 INFO L290 TraceCheckUtils]: 70: Hoare triple {6344#false} assume 4432 == #t~mem62;havoc #t~mem62; {6344#false} is VALID [2022-04-07 16:10:54,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {6344#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {6344#false} is VALID [2022-04-07 16:10:54,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {6344#false} assume 5 == ~blastFlag~0; {6344#false} is VALID [2022-04-07 16:10:54,472 INFO L290 TraceCheckUtils]: 73: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2022-04-07 16:10:54,473 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:10:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525025207] [2022-04-07 16:10:54,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525025207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:54,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:54,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565780258] [2022-04-07 16:10:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:54,474 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:54,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:54,474 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:10:54,541 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:10:54,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:54,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:54,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:54,543 INFO L87 Difference]: Start difference. First operand 264 states and 390 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:56,569 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:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:57,688 INFO L93 Difference]: Finished difference Result 415 states and 615 transitions. [2022-04-07 16:10:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:57,689 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:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:57,689 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:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-07 16:10:57,692 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:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-07 16:10:57,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 382 transitions. [2022-04-07 16:10:57,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:57,990 INFO L225 Difference]: With dead ends: 415 [2022-04-07 16:10:57,990 INFO L226 Difference]: Without dead ends: 280 [2022-04-07 16:10:57,991 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,993 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:57,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-07 16:10:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-07 16:10:58,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:58,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 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:10:58,004 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 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:10:58,005 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 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:10:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:58,011 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-04-07 16:10:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2022-04-07 16:10:58,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:58,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:58,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 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 280 states. [2022-04-07 16:10:58,013 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 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 280 states. [2022-04-07 16:10:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:58,020 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-04-07 16:10:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2022-04-07 16:10:58,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:58,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:58,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:58,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 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:10:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 389 transitions. [2022-04-07 16:10:58,028 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 389 transitions. Word has length 74 [2022-04-07 16:10:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:58,028 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 389 transitions. [2022-04-07 16:10:58,028 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:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 389 transitions. [2022-04-07 16:10:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 16:10:58,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:58,031 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:58,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 16:10:58,032 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-07 16:10:58,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:58,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503879184] [2022-04-07 16:10:58,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:58,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:58,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {7707#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {7700#true} is VALID [2022-04-07 16:10:58,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {7700#true} assume true; {7700#true} is VALID [2022-04-07 16:10:58,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7700#true} {7700#true} #593#return; {7700#true} is VALID [2022-04-07 16:10:58,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {7700#true} call ULTIMATE.init(); {7707#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:58,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {7707#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {7700#true} is VALID [2022-04-07 16:10:58,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {7700#true} assume true; {7700#true} is VALID [2022-04-07 16:10:58,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7700#true} {7700#true} #593#return; {7700#true} is VALID [2022-04-07 16:10:58,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {7700#true} call #t~ret158 := main(); {7700#true} is VALID [2022-04-07 16:10:58,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {7700#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; {7700#true} is VALID [2022-04-07 16:10:58,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {7700#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7700#true} is VALID [2022-04-07 16:10:58,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {7700#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); {7700#true} is VALID [2022-04-07 16:10:58,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {7700#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; {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {7700#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; {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {7700#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {7700#true} assume !false; {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {7700#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); {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {7700#true} assume 12292 == #t~mem49;havoc #t~mem49; {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {7700#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; {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {7700#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {7700#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {7700#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {7700#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); {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {7700#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {7700#true} assume !(0 == ~tmp___4~0); {7700#true} is VALID [2022-04-07 16:10:58,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {7700#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); {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {7700#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); {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {7700#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {7700#true} ~skip~0 := 0; {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {7700#true} assume !false; {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {7700#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); {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {7700#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {7700#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {7700#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {7700#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {7700#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {7700#true} assume 4368 == #t~mem54;havoc #t~mem54; {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {7700#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; {7700#true} is VALID [2022-04-07 16:10:58,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {7700#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7700#true} is VALID [2022-04-07 16:10:58,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {7700#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); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {7705#(= 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; {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {7705#(= 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); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {7705#(= 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; {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {7705#(= 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); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {7705#(= 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); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {7705#(= 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); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:10:58,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {7705#(= 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); {7706#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-07 16:10:58,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {7706#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {7701#false} is VALID [2022-04-07 16:10:58,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {7701#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {7701#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7701#false} is VALID [2022-04-07 16:10:58,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {7701#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {7701#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); {7701#false} is VALID [2022-04-07 16:10:58,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {7701#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {7701#false} assume !(0 == ~tmp___4~0); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {7701#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); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {7701#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); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {7701#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {7701#false} ~skip~0 := 0; {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {7701#false} assume !false; {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {7701#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); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {7701#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {7701#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {7701#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {7701#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {7701#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {7701#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {7701#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {7701#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {7701#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {7701#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {7701#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {7701#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {7701#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {7701#false} assume 4432 == #t~mem62;havoc #t~mem62; {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {7701#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {7701#false} assume 5 == ~blastFlag~0; {7701#false} is VALID [2022-04-07 16:10:58,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {7701#false} assume !false; {7701#false} is VALID [2022-04-07 16:10:58,331 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:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:58,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503879184] [2022-04-07 16:10:58,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503879184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:58,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:58,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731109787] [2022-04-07 16:10:58,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:58,332 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:58,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:58,333 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:58,416 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:58,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:58,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:58,417 INFO L87 Difference]: Start difference. First operand 264 states and 389 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:11:00,443 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:11:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:01,470 INFO L93 Difference]: Finished difference Result 415 states and 613 transitions. [2022-04-07 16:11:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:01,471 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:11:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:01,472 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:11:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-07 16:11:01,476 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:11:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-07 16:11:01,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 381 transitions. [2022-04-07 16:11:01,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:01,765 INFO L225 Difference]: With dead ends: 415 [2022-04-07 16:11:01,765 INFO L226 Difference]: Without dead ends: 280 [2022-04-07 16:11:01,766 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:11:01,766 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 31 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:01,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-07 16:11:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-07 16:11:01,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:01,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:01,774 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:01,775 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:01,781 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-07 16:11:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-07 16:11:01,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:01,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:01,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-07 16:11:01,783 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-07 16:11:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:01,789 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-07 16:11:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-07 16:11:01,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:01,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:01,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:01,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-07 16:11:01,797 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 75 [2022-04-07 16:11:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:01,797 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-07 16:11:01,798 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:11:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-07 16:11:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-07 16:11:01,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:01,799 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:11:01,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 16:11:01,799 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-07 16:11:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:01,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710009084] [2022-04-07 16:11:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:02,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:02,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {9064#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {9057#true} is VALID [2022-04-07 16:11:02,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {9057#true} assume true; {9057#true} is VALID [2022-04-07 16:11:02,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9057#true} {9057#true} #593#return; {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {9057#true} call ULTIMATE.init(); {9064#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:02,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {9064#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {9057#true} assume true; {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9057#true} {9057#true} #593#return; {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {9057#true} call #t~ret158 := main(); {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {9057#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; {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {9057#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {9057#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); {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {9057#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; {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {9057#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; {9057#true} is VALID [2022-04-07 16:11:02,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {9057#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {9057#true} assume !false; {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {9057#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); {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {9057#true} assume 12292 == #t~mem49;havoc #t~mem49; {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {9057#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; {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {9057#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {9057#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {9057#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {9057#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); {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {9057#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {9057#true} assume !(0 == ~tmp___4~0); {9057#true} is VALID [2022-04-07 16:11:02,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {9057#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); {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {9057#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); {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {9057#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {9057#true} ~skip~0 := 0; {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {9057#true} assume !false; {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {9057#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); {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {9057#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {9057#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {9057#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {9057#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {9057#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {9057#true} assume 4368 == #t~mem54;havoc #t~mem54; {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {9057#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; {9057#true} is VALID [2022-04-07 16:11:02,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {9057#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9057#true} is VALID [2022-04-07 16:11:02,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {9057#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); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {9062#(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; {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {9062#(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); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {9062#(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; {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {9062#(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); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {9062#(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); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {9062#(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); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {9062#(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); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:02,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {9062#(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); {9063#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-07 16:11:02,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {9063#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {9058#false} is VALID [2022-04-07 16:11:02,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {9058#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {9058#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9058#false} is VALID [2022-04-07 16:11:02,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {9058#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {9058#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); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {9058#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {9058#false} assume !(0 == ~tmp___4~0); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {9058#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); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {9058#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); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 55: Hoare triple {9058#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {9058#false} ~skip~0 := 0; {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {9058#false} assume !false; {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {9058#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); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 59: Hoare triple {9058#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {9058#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {9058#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 62: Hoare triple {9058#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {9058#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {9058#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {9058#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {9058#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {9058#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {9058#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 69: Hoare triple {9058#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 70: Hoare triple {9058#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {9058#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {9058#false} assume 4432 == #t~mem62;havoc #t~mem62; {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 73: Hoare triple {9058#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 74: Hoare triple {9058#false} assume 5 == ~blastFlag~0; {9058#false} is VALID [2022-04-07 16:11:02,043 INFO L290 TraceCheckUtils]: 75: Hoare triple {9058#false} assume !false; {9058#false} is VALID [2022-04-07 16:11:02,044 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:11:02,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:02,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710009084] [2022-04-07 16:11:02,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710009084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:02,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:02,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:02,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467931989] [2022-04-07 16:11:02,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:02,045 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:11:02,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:02,046 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:11:02,109 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:11:02,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:02,110 INFO L87 Difference]: Start difference. First operand 264 states and 388 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:11:04,135 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:11:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:05,215 INFO L93 Difference]: Finished difference Result 671 states and 994 transitions. [2022-04-07 16:11:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:05,216 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:11:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:05,216 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:11:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:11:05,219 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:11:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:11:05,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-07 16:11:05,673 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:11:05,684 INFO L225 Difference]: With dead ends: 671 [2022-04-07 16:11:05,684 INFO L226 Difference]: Without dead ends: 423 [2022-04-07 16:11:05,685 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:11:05,685 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:11:05,685 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:11:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-07 16:11:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 270. [2022-04-07 16:11:05,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:05,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states 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:11:05,700 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states 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:11:05,702 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states 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:11:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:05,713 INFO L93 Difference]: Finished difference Result 423 states and 623 transitions. [2022-04-07 16:11:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 623 transitions. [2022-04-07 16:11:05,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:05,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:05,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-07 16:11:05,716 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-07 16:11:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:05,729 INFO L93 Difference]: Finished difference Result 423 states and 623 transitions. [2022-04-07 16:11:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 623 transitions. [2022-04-07 16:11:05,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:05,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:05,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:05,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states 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:11:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 397 transitions. [2022-04-07 16:11:05,737 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 397 transitions. Word has length 76 [2022-04-07 16:11:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:05,737 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 397 transitions. [2022-04-07 16:11:05,737 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:11:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 397 transitions. [2022-04-07 16:11:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-07 16:11:05,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:05,740 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:11:05,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 16:11:05,740 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:05,741 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 1 times [2022-04-07 16:11:05,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:05,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449847854] [2022-04-07 16:11:05,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:05,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {11013#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {11007#true} is VALID [2022-04-07 16:11:05,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {11007#true} assume true; {11007#true} is VALID [2022-04-07 16:11:05,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11007#true} {11007#true} #593#return; {11007#true} is VALID [2022-04-07 16:11:05,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {11007#true} call ULTIMATE.init(); {11013#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:05,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {11013#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {11007#true} is VALID [2022-04-07 16:11:05,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {11007#true} assume true; {11007#true} is VALID [2022-04-07 16:11:05,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11007#true} {11007#true} #593#return; {11007#true} is VALID [2022-04-07 16:11:05,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {11007#true} call #t~ret158 := main(); {11007#true} is VALID [2022-04-07 16:11:05,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {11007#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; {11007#true} is VALID [2022-04-07 16:11:05,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {11007#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11007#true} is VALID [2022-04-07 16:11:05,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {11007#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); {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {11007#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; {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {11007#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; {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {11007#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {11007#true} assume !false; {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {11007#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); {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#true} assume 12292 == #t~mem49;havoc #t~mem49; {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#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; {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {11007#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {11007#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {11007#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {11007#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); {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {11007#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {11007#true} assume !(0 == ~tmp___4~0); {11007#true} is VALID [2022-04-07 16:11:05,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {11007#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); {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {11007#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); {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {11007#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {11007#true} ~skip~0 := 0; {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {11007#true} assume !false; {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {11007#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); {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {11007#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {11007#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {11007#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {11007#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {11007#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {11007#true} assume 4368 == #t~mem54;havoc #t~mem54; {11007#true} is VALID [2022-04-07 16:11:05,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {11007#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; {11007#true} is VALID [2022-04-07 16:11:05,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {11007#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {11012#(= 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); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {11012#(= 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; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {11012#(= 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); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !false; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {11012#(= 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); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {11008#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {11008#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {11008#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {11008#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); {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {11008#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {11008#false} ~skip~0 := 0; {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {11008#false} assume !false; {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {11008#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); {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {11008#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {11008#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {11008#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {11008#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {11008#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {11008#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {11008#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {11008#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {11008#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {11008#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {11008#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {11008#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {11008#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {11008#false} assume 4432 == #t~mem62;havoc #t~mem62; {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {11008#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11008#false} is VALID [2022-04-07 16:11:05,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {11008#false} assume 5 == ~blastFlag~0; {11008#false} is VALID [2022-04-07 16:11:05,926 INFO L290 TraceCheckUtils]: 76: Hoare triple {11008#false} assume !false; {11008#false} is VALID [2022-04-07 16:11:05,927 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:11:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:05,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449847854] [2022-04-07 16:11:05,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449847854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:05,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:05,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:11:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425957697] [2022-04-07 16:11:05,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:05,928 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:11:05,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:05,928 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:11:06,002 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:11:06,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:11:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:06,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:11:06,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:11:06,003 INFO L87 Difference]: Start difference. First operand 270 states and 397 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:11:08,025 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:11:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:08,695 INFO L93 Difference]: Finished difference Result 432 states and 637 transitions. [2022-04-07 16:11:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:11:08,695 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:11:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:08,696 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:11:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-07 16:11:08,698 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:11:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-07 16:11:08,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-07 16:11:08,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:09,004 INFO L225 Difference]: With dead ends: 432 [2022-04-07 16:11:09,004 INFO L226 Difference]: Without dead ends: 294 [2022-04-07 16:11:09,004 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:11:09,005 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:09,005 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 359 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:11:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-07 16:11:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-07 16:11:09,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:09,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states 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:11:09,012 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states 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:11:09,012 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states 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:11:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:09,019 INFO L93 Difference]: Finished difference Result 294 states and 429 transitions. [2022-04-07 16:11:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 429 transitions. [2022-04-07 16:11:09,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:09,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:09,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 294 states. [2022-04-07 16:11:09,021 INFO L87 Difference]: Start difference. First operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 294 states. [2022-04-07 16:11:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:09,028 INFO L93 Difference]: Finished difference Result 294 states and 429 transitions. [2022-04-07 16:11:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 429 transitions. [2022-04-07 16:11:09,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:09,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:09,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:09,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states 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:11:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 429 transitions. [2022-04-07 16:11:09,036 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 429 transitions. Word has length 77 [2022-04-07 16:11:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:09,036 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 429 transitions. [2022-04-07 16:11:09,037 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:11:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 429 transitions. [2022-04-07 16:11:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-07 16:11:09,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:09,038 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:11:09,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 16:11:09,038 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 1 times [2022-04-07 16:11:09,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:09,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415496559] [2022-04-07 16:11:09,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:09,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:09,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {12445#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {12439#true} is VALID [2022-04-07 16:11:09,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {12439#true} assume true; {12439#true} is VALID [2022-04-07 16:11:09,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12439#true} {12439#true} #593#return; {12439#true} is VALID [2022-04-07 16:11:09,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {12439#true} call ULTIMATE.init(); {12445#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:09,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {12445#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {12439#true} is VALID [2022-04-07 16:11:09,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {12439#true} assume true; {12439#true} is VALID [2022-04-07 16:11:09,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12439#true} {12439#true} #593#return; {12439#true} is VALID [2022-04-07 16:11:09,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {12439#true} call #t~ret158 := main(); {12439#true} is VALID [2022-04-07 16:11:09,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {12439#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; {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {12439#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {12439#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; {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {12439#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; {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {12439#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {12439#true} assume !false; {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {12439#true} assume 12292 == #t~mem49;havoc #t~mem49; {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {12439#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; {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {12439#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {12439#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12439#true} is VALID [2022-04-07 16:11:09,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {12439#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {12439#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {12439#true} assume !(0 == ~tmp___4~0); {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {12439#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {12439#true} ~skip~0 := 0; {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {12439#true} assume !false; {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {12439#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {12439#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {12439#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {12439#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {12439#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {12439#true} assume 4368 == #t~mem54;havoc #t~mem54; {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {12439#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; {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {12439#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {12439#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; {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {12439#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {12439#true} ~skip~0 := 0; {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {12439#true} assume !false; {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {12439#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); {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {12439#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {12439#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {12439#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {12439#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {12439#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {12439#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {12439#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-07 16:11:09,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {12439#true} assume 4384 == #t~mem56;havoc #t~mem56; {12439#true} is VALID [2022-04-07 16:11:09,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {12439#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12439#true} is VALID [2022-04-07 16:11:09,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {12439#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {12444#(= 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); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {12444#(= 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); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:09,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {12440#false} is VALID [2022-04-07 16:11:09,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {12440#false} assume !false; {12440#false} is VALID [2022-04-07 16:11:09,237 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:11:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:09,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415496559] [2022-04-07 16:11:09,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415496559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:09,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:09,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:11:09,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276934657] [2022-04-07 16:11:09,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:09,239 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:11:09,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:09,239 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:11:09,308 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:11:09,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:11:09,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:11:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:11:09,309 INFO L87 Difference]: Start difference. First operand 294 states and 429 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:11:11,330 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:11:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:12,263 INFO L93 Difference]: Finished difference Result 590 states and 869 transitions. [2022-04-07 16:11:12,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:11:12,263 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:11:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:12,263 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:11:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-07 16:11:12,267 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:11:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-07 16:11:12,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-07 16:11:12,671 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:11:12,682 INFO L225 Difference]: With dead ends: 590 [2022-04-07 16:11:12,682 INFO L226 Difference]: Without dead ends: 428 [2022-04-07 16:11:12,682 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:11:12,683 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:12,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 477 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-07 16:11:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2022-04-07 16:11:12,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:12,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states 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:11:12,693 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states 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:11:12,694 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states 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:11:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:12,707 INFO L93 Difference]: Finished difference Result 428 states and 626 transitions. [2022-04-07 16:11:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 626 transitions. [2022-04-07 16:11:12,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:12,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:12,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 428 states. [2022-04-07 16:11:12,710 INFO L87 Difference]: Start difference. First operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 428 states. [2022-04-07 16:11:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:12,722 INFO L93 Difference]: Finished difference Result 428 states and 626 transitions. [2022-04-07 16:11:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 626 transitions. [2022-04-07 16:11:12,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:12,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:12,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:12,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states 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:11:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 626 transitions. [2022-04-07 16:11:12,736 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 626 transitions. Word has length 77 [2022-04-07 16:11:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:12,736 INFO L478 AbstractCegarLoop]: Abstraction has 428 states and 626 transitions. [2022-04-07 16:11:12,737 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:11:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 626 transitions. [2022-04-07 16:11:12,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-07 16:11:12,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:12,738 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:11:12,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 16:11:12,738 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:12,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 1 times [2022-04-07 16:11:12,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:12,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134199029] [2022-04-07 16:11:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:12,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {14476#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {14470#true} is VALID [2022-04-07 16:11:12,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {14470#true} assume true; {14470#true} is VALID [2022-04-07 16:11:12,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14470#true} {14470#true} #593#return; {14470#true} is VALID [2022-04-07 16:11:12,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {14470#true} call ULTIMATE.init(); {14476#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:12,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {14476#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {14470#true} is VALID [2022-04-07 16:11:12,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {14470#true} assume true; {14470#true} is VALID [2022-04-07 16:11:12,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14470#true} {14470#true} #593#return; {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {14470#true} call #t~ret158 := main(); {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {14470#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; {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {14470#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {14470#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; {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {14470#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; {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {14470#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {14470#true} assume !false; {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {14470#true} assume 12292 == #t~mem49;havoc #t~mem49; {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {14470#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; {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {14470#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {14470#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {14470#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {14470#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {14470#true} assume !(0 == ~tmp___4~0); {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {14470#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {14470#true} ~skip~0 := 0; {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {14470#true} assume !false; {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {14470#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {14470#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {14470#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {14470#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {14470#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {14470#true} assume 4368 == #t~mem54;havoc #t~mem54; {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {14470#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; {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {14470#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {14470#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; {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {14470#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {14470#true} ~skip~0 := 0; {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {14470#true} assume !false; {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {14470#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {14470#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {14470#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {14470#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {14470#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {14470#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {14470#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {14470#true} assume 4384 == #t~mem56;havoc #t~mem56; {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {14470#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {14470#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {14470#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {14470#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {14470#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {14470#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {14470#true} is VALID [2022-04-07 16:11:12,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {14470#true} ~skip~0 := 0; {14470#true} is VALID [2022-04-07 16:11:12,986 INFO L290 TraceCheckUtils]: 58: Hoare triple {14470#true} assume !false; {14470#true} is VALID [2022-04-07 16:11:12,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {14470#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {14470#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {14470#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {14470#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {14470#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {14470#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {14470#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,994 INFO L290 TraceCheckUtils]: 67: Hoare triple {14470#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,994 INFO L290 TraceCheckUtils]: 68: Hoare triple {14470#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-07 16:11:12,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {14470#true} assume 4400 == #t~mem58;havoc #t~mem58; {14470#true} is VALID [2022-04-07 16:11:12,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {14470#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); {14470#true} is VALID [2022-04-07 16:11:12,995 INFO L290 TraceCheckUtils]: 71: Hoare triple {14470#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; {14470#true} is VALID [2022-04-07 16:11:12,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {14470#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {14475#(= 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); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {14475#(= 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); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,997 INFO L290 TraceCheckUtils]: 77: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,997 INFO L290 TraceCheckUtils]: 78: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,997 INFO L290 TraceCheckUtils]: 79: Hoare triple {14475#(= 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); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,998 INFO L290 TraceCheckUtils]: 80: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,998 INFO L290 TraceCheckUtils]: 81: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,998 INFO L290 TraceCheckUtils]: 82: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,998 INFO L290 TraceCheckUtils]: 83: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,999 INFO L290 TraceCheckUtils]: 84: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,999 INFO L290 TraceCheckUtils]: 85: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:12,999 INFO L290 TraceCheckUtils]: 86: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,000 INFO L290 TraceCheckUtils]: 87: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,000 INFO L290 TraceCheckUtils]: 88: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,000 INFO L290 TraceCheckUtils]: 89: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,000 INFO L290 TraceCheckUtils]: 90: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,001 INFO L290 TraceCheckUtils]: 91: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,001 INFO L290 TraceCheckUtils]: 92: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,001 INFO L290 TraceCheckUtils]: 93: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,002 INFO L290 TraceCheckUtils]: 94: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:11:13,002 INFO L290 TraceCheckUtils]: 95: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {14471#false} is VALID [2022-04-07 16:11:13,002 INFO L290 TraceCheckUtils]: 96: Hoare triple {14471#false} assume !false; {14471#false} is VALID [2022-04-07 16:11:13,002 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:11:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:13,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134199029] [2022-04-07 16:11:13,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134199029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:13,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:13,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:11:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363257828] [2022-04-07 16:11:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:13,003 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:11:13,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:13,004 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:11:13,073 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:11:13,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:11:13,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:11:13,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:11:13,074 INFO L87 Difference]: Start difference. First operand 428 states and 626 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:11:15,103 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:11:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:16,219 INFO L93 Difference]: Finished difference Result 858 states and 1264 transitions. [2022-04-07 16:11:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:11:16,219 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:11:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:16,220 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:11:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-07 16:11:16,223 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:11:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-07 16:11:16,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-07 16:11:16,626 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:11:16,642 INFO L225 Difference]: With dead ends: 858 [2022-04-07 16:11:16,643 INFO L226 Difference]: Without dead ends: 562 [2022-04-07 16:11:16,643 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:11:16,644 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:11:16,644 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:11:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-04-07 16:11:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-04-07 16:11:16,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:16,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 562 states. Second operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states 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:11:16,657 INFO L74 IsIncluded]: Start isIncluded. First operand 562 states. Second operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states 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:11:16,658 INFO L87 Difference]: Start difference. First operand 562 states. Second operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states 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:11:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:16,676 INFO L93 Difference]: Finished difference Result 562 states and 823 transitions. [2022-04-07 16:11:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 823 transitions. [2022-04-07 16:11:16,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:16,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:16,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 562 states. [2022-04-07 16:11:16,687 INFO L87 Difference]: Start difference. First operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 562 states. [2022-04-07 16:11:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:16,705 INFO L93 Difference]: Finished difference Result 562 states and 823 transitions. [2022-04-07 16:11:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 823 transitions. [2022-04-07 16:11:16,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:16,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:16,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:16,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states 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:11:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 823 transitions. [2022-04-07 16:11:16,728 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 823 transitions. Word has length 97 [2022-04-07 16:11:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:16,728 INFO L478 AbstractCegarLoop]: Abstraction has 562 states and 823 transitions. [2022-04-07 16:11:16,728 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:11:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 823 transitions. [2022-04-07 16:11:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-07 16:11:16,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:16,732 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:11:16,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 16:11:16,732 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-07 16:11:16,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:16,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369234741] [2022-04-07 16:11:16,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:16,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:16,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:16,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {17231#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {17225#true} is VALID [2022-04-07 16:11:16,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {17225#true} assume true; {17225#true} is VALID [2022-04-07 16:11:16,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17225#true} {17225#true} #593#return; {17225#true} is VALID [2022-04-07 16:11:16,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {17225#true} call ULTIMATE.init(); {17231#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:16,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {17231#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {17225#true} is VALID [2022-04-07 16:11:16,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {17225#true} assume true; {17225#true} is VALID [2022-04-07 16:11:16,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17225#true} {17225#true} #593#return; {17225#true} is VALID [2022-04-07 16:11:16,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {17225#true} call #t~ret158 := main(); {17225#true} is VALID [2022-04-07 16:11:16,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {17225#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; {17225#true} is VALID [2022-04-07 16:11:16,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {17225#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {17225#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; {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {17225#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; {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {17225#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {17225#true} assume !false; {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {17225#true} assume 12292 == #t~mem49;havoc #t~mem49; {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {17225#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; {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {17225#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {17225#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {17225#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {17225#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {17225#true} is VALID [2022-04-07 16:11:16,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {17225#true} assume !(0 == ~tmp___4~0); {17225#true} is VALID [2022-04-07 16:11:16,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {17225#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17225#true} is VALID [2022-04-07 16:11:16,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {17225#true} ~skip~0 := 0; {17225#true} is VALID [2022-04-07 16:11:16,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {17225#true} assume !false; {17225#true} is VALID [2022-04-07 16:11:16,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {17225#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {17225#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {17225#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {17225#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {17225#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {17225#true} assume 4368 == #t~mem54;havoc #t~mem54; {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {17225#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; {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {17225#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {17225#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; {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {17225#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17225#true} is VALID [2022-04-07 16:11:16,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {17225#true} ~skip~0 := 0; {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {17225#true} assume !false; {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {17225#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {17225#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {17225#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {17225#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {17225#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 47: Hoare triple {17225#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {17225#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {17225#true} assume 4384 == #t~mem56;havoc #t~mem56; {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {17225#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {17225#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {17225#true} is VALID [2022-04-07 16:11:16,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {17225#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {17225#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {17225#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {17225#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 57: Hoare triple {17225#true} ~skip~0 := 0; {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {17225#true} assume !false; {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 60: Hoare triple {17225#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 61: Hoare triple {17225#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 62: Hoare triple {17225#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 63: Hoare triple {17225#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 64: Hoare triple {17225#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 65: Hoare triple {17225#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,984 INFO L290 TraceCheckUtils]: 66: Hoare triple {17225#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 67: Hoare triple {17225#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 68: Hoare triple {17225#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 69: Hoare triple {17225#true} assume 4400 == #t~mem58;havoc #t~mem58; {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 71: Hoare triple {17225#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; {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 72: Hoare triple {17225#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 73: Hoare triple {17225#true} assume !(~ret~0 <= 0); {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 74: Hoare triple {17225#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 75: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 76: Hoare triple {17225#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 77: Hoare triple {17225#true} ~skip~0 := 0; {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 78: Hoare triple {17225#true} assume !false; {17225#true} is VALID [2022-04-07 16:11:16,985 INFO L290 TraceCheckUtils]: 79: Hoare triple {17225#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); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 80: Hoare triple {17225#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 81: Hoare triple {17225#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 82: Hoare triple {17225#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 83: Hoare triple {17225#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 84: Hoare triple {17225#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 85: Hoare triple {17225#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 86: Hoare triple {17225#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 87: Hoare triple {17225#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 88: Hoare triple {17225#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {17225#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {17225#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 91: Hoare triple {17225#true} assume 4416 == #t~mem60;havoc #t~mem60; {17225#true} is VALID [2022-04-07 16:11:16,986 INFO L290 TraceCheckUtils]: 92: Hoare triple {17225#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {17225#true} is VALID [2022-04-07 16:11:16,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {17225#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {17230#(= 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); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,987 INFO L290 TraceCheckUtils]: 95: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {17230#(= 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); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,989 INFO L290 TraceCheckUtils]: 99: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !false; {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,989 INFO L290 TraceCheckUtils]: 100: Hoare triple {17230#(= 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); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,989 INFO L290 TraceCheckUtils]: 101: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,989 INFO L290 TraceCheckUtils]: 102: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,990 INFO L290 TraceCheckUtils]: 103: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,990 INFO L290 TraceCheckUtils]: 104: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,990 INFO L290 TraceCheckUtils]: 105: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,990 INFO L290 TraceCheckUtils]: 106: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,991 INFO L290 TraceCheckUtils]: 107: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,991 INFO L290 TraceCheckUtils]: 108: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,991 INFO L290 TraceCheckUtils]: 109: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,992 INFO L290 TraceCheckUtils]: 110: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,992 INFO L290 TraceCheckUtils]: 111: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,992 INFO L290 TraceCheckUtils]: 112: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,992 INFO L290 TraceCheckUtils]: 113: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,993 INFO L290 TraceCheckUtils]: 115: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {17230#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:11:16,993 INFO L290 TraceCheckUtils]: 116: Hoare triple {17230#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {17226#false} is VALID [2022-04-07 16:11:16,993 INFO L290 TraceCheckUtils]: 117: Hoare triple {17226#false} assume !false; {17226#false} is VALID [2022-04-07 16:11:16,994 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:11:16,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:16,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369234741] [2022-04-07 16:11:16,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369234741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:16,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:16,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:11:16,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883843514] [2022-04-07 16:11:16,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:16,995 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:11:16,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:16,995 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:11:17,064 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:11:17,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:11:17,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:17,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:11:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:11:17,066 INFO L87 Difference]: Start difference. First operand 562 states and 823 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:11:19,087 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:11:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:20,137 INFO L93 Difference]: Finished difference Result 1127 states and 1659 transitions. [2022-04-07 16:11:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:11:20,138 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:11:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:20,138 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:11:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-07 16:11:20,141 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:11:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-07 16:11:20,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-07 16:11:20,486 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:11:20,512 INFO L225 Difference]: With dead ends: 1127 [2022-04-07 16:11:20,512 INFO L226 Difference]: Without dead ends: 697 [2022-04-07 16:11:20,513 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:11:20,513 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 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:11:20,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 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:11:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-04-07 16:11:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2022-04-07 16:11:20,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:20,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 697 states. Second operand has 697 states, 692 states have (on average 1.4696531791907514) internal successors, (1017), 692 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states 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:11:20,528 INFO L74 IsIncluded]: Start isIncluded. First operand 697 states. Second operand has 697 states, 692 states have (on average 1.4696531791907514) internal successors, (1017), 692 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states 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:11:20,529 INFO L87 Difference]: Start difference. First operand 697 states. Second operand has 697 states, 692 states have (on average 1.4696531791907514) internal successors, (1017), 692 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states 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:11:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:20,553 INFO L93 Difference]: Finished difference Result 697 states and 1021 transitions. [2022-04-07 16:11:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1021 transitions. [2022-04-07 16:11:20,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:20,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:20,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 692 states have (on average 1.4696531791907514) internal successors, (1017), 692 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 697 states. [2022-04-07 16:11:20,557 INFO L87 Difference]: Start difference. First operand has 697 states, 692 states have (on average 1.4696531791907514) internal successors, (1017), 692 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 697 states. [2022-04-07 16:11:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:20,581 INFO L93 Difference]: Finished difference Result 697 states and 1021 transitions. [2022-04-07 16:11:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1021 transitions. [2022-04-07 16:11:20,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:20,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:20,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:20,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 692 states have (on average 1.4696531791907514) internal successors, (1017), 692 states have internal predecessors, (1017), 3 states have call successors, (3), 3 states 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:11:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1021 transitions. [2022-04-07 16:11:20,612 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1021 transitions. Word has length 118 [2022-04-07 16:11:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:20,612 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 1021 transitions. [2022-04-07 16:11:20,612 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:11:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1021 transitions. [2022-04-07 16:11:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-07 16:11:20,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:20,614 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:20,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 16:11:20,615 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1826850427, now seen corresponding path program 1 times [2022-04-07 16:11:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:20,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737860402] [2022-04-07 16:11:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:20,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {20715#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {20708#true} is VALID [2022-04-07 16:11:20,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {20708#true} assume true; {20708#true} is VALID [2022-04-07 16:11:20,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20708#true} {20708#true} #593#return; {20708#true} is VALID [2022-04-07 16:11:20,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {20708#true} call ULTIMATE.init(); {20715#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:20,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {20715#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {20708#true} is VALID [2022-04-07 16:11:20,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {20708#true} assume true; {20708#true} is VALID [2022-04-07 16:11:20,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20708#true} {20708#true} #593#return; {20708#true} is VALID [2022-04-07 16:11:20,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {20708#true} call #t~ret158 := main(); {20708#true} is VALID [2022-04-07 16:11:20,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {20708#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; {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {20708#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {20708#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; {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {20708#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; {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {20708#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {20708#true} assume !false; {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {20708#true} assume 12292 == #t~mem49;havoc #t~mem49; {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {20708#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; {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {20708#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {20708#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {20708#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {20708#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {20708#true} assume !(0 == ~tmp___4~0); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {20708#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {20708#true} ~skip~0 := 0; {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {20708#true} assume !false; {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {20708#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {20708#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {20708#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {20708#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {20708#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {20708#true} assume 4368 == #t~mem54;havoc #t~mem54; {20708#true} is VALID [2022-04-07 16:11:20,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {20708#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; {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {20708#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {20708#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; {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {20708#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {20708#true} ~skip~0 := 0; {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {20708#true} assume !false; {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {20708#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); {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {20708#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {20708#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {20708#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {20708#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {20708#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {20708#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {20708#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {20708#true} assume 4384 == #t~mem56;havoc #t~mem56; {20708#true} is VALID [2022-04-07 16:11:20,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {20708#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {20708#true} is VALID [2022-04-07 16:11:20,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {20708#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {20708#true} is VALID [2022-04-07 16:11:20,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {20708#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {20708#true} is VALID [2022-04-07 16:11:20,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {20708#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {20713#(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; {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,876 INFO L290 TraceCheckUtils]: 67: Hoare triple {20713#(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); {20713#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:20,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {20713#(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); {20714#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {20714#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {20709#false} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 70: Hoare triple {20709#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); {20709#false} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 71: Hoare triple {20709#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;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {20709#false} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {20709#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {20709#false} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {20709#false} assume !(~ret~0 <= 0); {20709#false} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {20709#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 75: Hoare triple {20709#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); {20709#false} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {20709#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20709#false} is VALID [2022-04-07 16:11:20,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {20709#false} ~skip~0 := 0; {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 78: Hoare triple {20709#false} assume !false; {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 79: Hoare triple {20709#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); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 80: Hoare triple {20709#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {20709#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {20709#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {20709#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {20709#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 85: Hoare triple {20709#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 86: Hoare triple {20709#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 87: Hoare triple {20709#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 88: Hoare triple {20709#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 89: Hoare triple {20709#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 90: Hoare triple {20709#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,878 INFO L290 TraceCheckUtils]: 91: Hoare triple {20709#false} assume 4416 == #t~mem60;havoc #t~mem60; {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 92: Hoare triple {20709#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 93: Hoare triple {20709#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 94: Hoare triple {20709#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 95: Hoare triple {20709#false} assume !(0 == ~tmp___6~0); {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 96: Hoare triple {20709#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); {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 97: Hoare triple {20709#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 98: Hoare triple {20709#false} ~skip~0 := 0; {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 99: Hoare triple {20709#false} assume !false; {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 100: Hoare triple {20709#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); {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 101: Hoare triple {20709#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 102: Hoare triple {20709#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 103: Hoare triple {20709#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {20709#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 105: Hoare triple {20709#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 106: Hoare triple {20709#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 107: Hoare triple {20709#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 108: Hoare triple {20709#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 109: Hoare triple {20709#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 110: Hoare triple {20709#false} assume 4400 == #t~mem58;havoc #t~mem58; {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 111: Hoare triple {20709#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); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 112: Hoare triple {20709#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;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 113: Hoare triple {20709#false} assume !(2 == ~blastFlag~0); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 114: Hoare triple {20709#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 115: Hoare triple {20709#false} assume !(~ret~0 <= 0); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 116: Hoare triple {20709#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,880 INFO L290 TraceCheckUtils]: 117: Hoare triple {20709#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); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 118: Hoare triple {20709#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 119: Hoare triple {20709#false} ~skip~0 := 0; {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 120: Hoare triple {20709#false} assume !false; {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 121: Hoare triple {20709#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); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 122: Hoare triple {20709#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 123: Hoare triple {20709#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 124: Hoare triple {20709#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 125: Hoare triple {20709#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 126: Hoare triple {20709#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 127: Hoare triple {20709#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 128: Hoare triple {20709#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 129: Hoare triple {20709#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 130: Hoare triple {20709#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 131: Hoare triple {20709#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,881 INFO L290 TraceCheckUtils]: 132: Hoare triple {20709#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,882 INFO L290 TraceCheckUtils]: 133: Hoare triple {20709#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,882 INFO L290 TraceCheckUtils]: 134: Hoare triple {20709#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20709#false} is VALID [2022-04-07 16:11:20,882 INFO L290 TraceCheckUtils]: 135: Hoare triple {20709#false} assume 4432 == #t~mem62;havoc #t~mem62; {20709#false} is VALID [2022-04-07 16:11:20,882 INFO L290 TraceCheckUtils]: 136: Hoare triple {20709#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {20709#false} is VALID [2022-04-07 16:11:20,882 INFO L290 TraceCheckUtils]: 137: Hoare triple {20709#false} assume 5 == ~blastFlag~0; {20709#false} is VALID [2022-04-07 16:11:20,882 INFO L290 TraceCheckUtils]: 138: Hoare triple {20709#false} assume !false; {20709#false} is VALID [2022-04-07 16:11:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-07 16:11:20,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:20,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737860402] [2022-04-07 16:11:20,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737860402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:20,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:20,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092479056] [2022-04-07 16:11:20,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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 139 [2022-04-07 16:11:20,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:20,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states 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:11:20,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:20,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:20,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:20,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:20,961 INFO L87 Difference]: Start difference. First operand 697 states and 1021 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states 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:11:23,000 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:11:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:24,066 INFO L93 Difference]: Finished difference Result 1836 states and 2695 transitions. [2022-04-07 16:11:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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 139 [2022-04-07 16:11:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states 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:11:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:11:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states 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:11:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:11:24,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-07 16:11:24,421 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:11:24,465 INFO L225 Difference]: With dead ends: 1836 [2022-04-07 16:11:24,465 INFO L226 Difference]: Without dead ends: 1155 [2022-04-07 16:11:24,467 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:11:24,467 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 110 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:24,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-04-07 16:11:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 802. [2022-04-07 16:11:24,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:24,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1155 states. Second operand has 802 states, 797 states have (on average 1.4830614805520703) internal successors, (1182), 797 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states 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:11:24,488 INFO L74 IsIncluded]: Start isIncluded. First operand 1155 states. Second operand has 802 states, 797 states have (on average 1.4830614805520703) internal successors, (1182), 797 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states 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:11:24,489 INFO L87 Difference]: Start difference. First operand 1155 states. Second operand has 802 states, 797 states have (on average 1.4830614805520703) internal successors, (1182), 797 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states 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:11:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:24,537 INFO L93 Difference]: Finished difference Result 1155 states and 1689 transitions. [2022-04-07 16:11:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1689 transitions. [2022-04-07 16:11:24,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:24,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:24,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 802 states, 797 states have (on average 1.4830614805520703) internal successors, (1182), 797 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1155 states. [2022-04-07 16:11:24,542 INFO L87 Difference]: Start difference. First operand has 802 states, 797 states have (on average 1.4830614805520703) internal successors, (1182), 797 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1155 states. [2022-04-07 16:11:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:24,592 INFO L93 Difference]: Finished difference Result 1155 states and 1689 transitions. [2022-04-07 16:11:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1689 transitions. [2022-04-07 16:11:24,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:24,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:24,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:24,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 797 states have (on average 1.4830614805520703) internal successors, (1182), 797 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states 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:11:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1186 transitions. [2022-04-07 16:11:24,625 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1186 transitions. Word has length 139 [2022-04-07 16:11:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:24,625 INFO L478 AbstractCegarLoop]: Abstraction has 802 states and 1186 transitions. [2022-04-07 16:11:24,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states 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:11:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1186 transitions. [2022-04-07 16:11:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-07 16:11:24,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:24,627 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:24,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 16:11:24,627 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1784272250, now seen corresponding path program 1 times [2022-04-07 16:11:24,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:24,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030823741] [2022-04-07 16:11:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:24,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:24,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {26052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {26045#true} is VALID [2022-04-07 16:11:24,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {26045#true} assume true; {26045#true} is VALID [2022-04-07 16:11:24,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26045#true} {26045#true} #593#return; {26045#true} is VALID [2022-04-07 16:11:24,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {26045#true} call ULTIMATE.init(); {26052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:24,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {26052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {26045#true} is VALID [2022-04-07 16:11:24,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {26045#true} assume true; {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26045#true} {26045#true} #593#return; {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {26045#true} call #t~ret158 := main(); {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {26045#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; {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L272 TraceCheckUtils]: 6: Hoare triple {26045#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {26045#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; {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {26045#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; {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {26045#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {26045#true} assume !false; {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {26045#true} assume 12292 == #t~mem49;havoc #t~mem49; {26045#true} is VALID [2022-04-07 16:11:24,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {26045#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; {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {26045#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {26045#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {26045#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {26045#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#true} assume !(0 == ~tmp___4~0); {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {26045#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {26045#true} ~skip~0 := 0; {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {26045#true} assume !false; {26045#true} is VALID [2022-04-07 16:11:24,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {26045#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {26045#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {26045#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {26045#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {26045#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {26045#true} assume 4368 == #t~mem54;havoc #t~mem54; {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {26045#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; {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {26045#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {26045#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; {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {26045#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26045#true} is VALID [2022-04-07 16:11:24,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {26045#true} ~skip~0 := 0; {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {26045#true} assume !false; {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {26045#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {26045#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {26045#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {26045#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {26045#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {26045#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {26045#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {26045#true} assume 4384 == #t~mem56;havoc #t~mem56; {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {26045#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {26045#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {26045#true} is VALID [2022-04-07 16:11:24,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {26045#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {26045#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {26045#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {26045#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {26045#true} ~skip~0 := 0; {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {26045#true} assume !false; {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {26045#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {26045#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 62: Hoare triple {26045#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,891 INFO L290 TraceCheckUtils]: 63: Hoare triple {26045#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {26045#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {26045#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 66: Hoare triple {26045#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 67: Hoare triple {26045#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 68: Hoare triple {26045#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 69: Hoare triple {26045#true} assume 4400 == #t~mem58;havoc #t~mem58; {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 70: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 71: Hoare triple {26045#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; {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 72: Hoare triple {26045#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 73: Hoare triple {26045#true} assume !(~ret~0 <= 0); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {26045#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {26045#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26045#true} is VALID [2022-04-07 16:11:24,892 INFO L290 TraceCheckUtils]: 77: Hoare triple {26045#true} ~skip~0 := 0; {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 78: Hoare triple {26045#true} assume !false; {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 79: Hoare triple {26045#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); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 80: Hoare triple {26045#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 81: Hoare triple {26045#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 82: Hoare triple {26045#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 83: Hoare triple {26045#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 84: Hoare triple {26045#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 85: Hoare triple {26045#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 86: Hoare triple {26045#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 87: Hoare triple {26045#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 88: Hoare triple {26045#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,893 INFO L290 TraceCheckUtils]: 89: Hoare triple {26045#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,894 INFO L290 TraceCheckUtils]: 90: Hoare triple {26045#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26045#true} is VALID [2022-04-07 16:11:24,894 INFO L290 TraceCheckUtils]: 91: Hoare triple {26045#true} assume 4416 == #t~mem60;havoc #t~mem60; {26045#true} is VALID [2022-04-07 16:11:24,894 INFO L290 TraceCheckUtils]: 92: Hoare triple {26045#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {26045#true} is VALID [2022-04-07 16:11:24,894 INFO L290 TraceCheckUtils]: 93: Hoare triple {26045#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {26045#true} is VALID [2022-04-07 16:11:24,895 INFO L290 TraceCheckUtils]: 94: Hoare triple {26045#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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,895 INFO L290 TraceCheckUtils]: 95: Hoare triple {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,895 INFO L290 TraceCheckUtils]: 96: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,896 INFO L290 TraceCheckUtils]: 97: Hoare triple {26050#(= 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; {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,896 INFO L290 TraceCheckUtils]: 98: Hoare triple {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,896 INFO L290 TraceCheckUtils]: 99: Hoare triple {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,897 INFO L290 TraceCheckUtils]: 100: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,897 INFO L290 TraceCheckUtils]: 101: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,897 INFO L290 TraceCheckUtils]: 102: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,897 INFO L290 TraceCheckUtils]: 103: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,898 INFO L290 TraceCheckUtils]: 104: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,898 INFO L290 TraceCheckUtils]: 105: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,898 INFO L290 TraceCheckUtils]: 106: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,899 INFO L290 TraceCheckUtils]: 107: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,899 INFO L290 TraceCheckUtils]: 108: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,899 INFO L290 TraceCheckUtils]: 109: Hoare triple {26050#(= 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); {26050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 110: Hoare triple {26050#(= 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); {26051#(= |ssl3_connect_#t~mem59| 4432)} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 111: Hoare triple {26051#(= |ssl3_connect_#t~mem59| 4432)} assume 4401 == #t~mem59;havoc #t~mem59; {26046#false} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 112: Hoare triple {26046#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); {26046#false} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 113: Hoare triple {26046#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;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {26046#false} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 114: Hoare triple {26046#false} assume !(2 == ~blastFlag~0); {26046#false} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 115: Hoare triple {26046#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {26046#false} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 116: Hoare triple {26046#false} assume !(~ret~0 <= 0); {26046#false} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 117: Hoare triple {26046#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,900 INFO L290 TraceCheckUtils]: 118: Hoare triple {26046#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); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 119: Hoare triple {26046#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 120: Hoare triple {26046#false} ~skip~0 := 0; {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 121: Hoare triple {26046#false} assume !false; {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 122: Hoare triple {26046#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); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 123: Hoare triple {26046#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 124: Hoare triple {26046#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 125: Hoare triple {26046#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 126: Hoare triple {26046#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 127: Hoare triple {26046#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 128: Hoare triple {26046#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 129: Hoare triple {26046#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 130: Hoare triple {26046#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,901 INFO L290 TraceCheckUtils]: 131: Hoare triple {26046#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,902 INFO L290 TraceCheckUtils]: 132: Hoare triple {26046#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,902 INFO L290 TraceCheckUtils]: 133: Hoare triple {26046#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,902 INFO L290 TraceCheckUtils]: 134: Hoare triple {26046#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,902 INFO L290 TraceCheckUtils]: 135: Hoare triple {26046#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26046#false} is VALID [2022-04-07 16:11:24,902 INFO L290 TraceCheckUtils]: 136: Hoare triple {26046#false} assume 4432 == #t~mem62;havoc #t~mem62; {26046#false} is VALID [2022-04-07 16:11:24,902 INFO L290 TraceCheckUtils]: 137: Hoare triple {26046#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {26046#false} is VALID [2022-04-07 16:11:24,902 INFO L290 TraceCheckUtils]: 138: Hoare triple {26046#false} assume 5 == ~blastFlag~0; {26046#false} is VALID [2022-04-07 16:11:24,902 INFO L290 TraceCheckUtils]: 139: Hoare triple {26046#false} assume !false; {26046#false} is VALID [2022-04-07 16:11:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-07 16:11:24,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:24,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030823741] [2022-04-07 16:11:24,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030823741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:24,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:24,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:24,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570312085] [2022-04-07 16:11:24,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:24,904 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 140 [2022-04-07 16:11:24,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:24,904 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:11:24,993 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:11:24,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:24,993 INFO L87 Difference]: Start difference. First operand 802 states and 1186 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:11:27,019 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:11:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:28,397 INFO L93 Difference]: Finished difference Result 1930 states and 2857 transitions. [2022-04-07 16:11:28,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:28,397 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 140 [2022-04-07 16:11:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:28,398 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:11:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-07 16:11:28,400 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:11:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-07 16:11:28,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-07 16:11:28,708 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:11:28,751 INFO L225 Difference]: With dead ends: 1930 [2022-04-07 16:11:28,751 INFO L226 Difference]: Without dead ends: 1144 [2022-04-07 16:11:28,752 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:11:28,753 INFO L913 BasicCegarLoop]: 236 mSDtfsCounter, 89 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:28,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 561 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 533 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:11:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2022-04-07 16:11:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 886. [2022-04-07 16:11:28,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:28,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1144 states. Second operand has 886 states, 881 states have (on average 1.4914869466515324) internal successors, (1314), 881 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:28,776 INFO L74 IsIncluded]: Start isIncluded. First operand 1144 states. Second operand has 886 states, 881 states have (on average 1.4914869466515324) internal successors, (1314), 881 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:28,777 INFO L87 Difference]: Start difference. First operand 1144 states. Second operand has 886 states, 881 states have (on average 1.4914869466515324) internal successors, (1314), 881 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:28,824 INFO L93 Difference]: Finished difference Result 1144 states and 1687 transitions. [2022-04-07 16:11:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1687 transitions. [2022-04-07 16:11:28,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:28,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:28,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4914869466515324) internal successors, (1314), 881 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1144 states. [2022-04-07 16:11:28,827 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4914869466515324) internal successors, (1314), 881 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1144 states. [2022-04-07 16:11:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:28,869 INFO L93 Difference]: Finished difference Result 1144 states and 1687 transitions. [2022-04-07 16:11:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1687 transitions. [2022-04-07 16:11:28,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:28,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:28,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:28,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4914869466515324) internal successors, (1314), 881 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1318 transitions. [2022-04-07 16:11:28,903 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1318 transitions. Word has length 140 [2022-04-07 16:11:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:28,903 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1318 transitions. [2022-04-07 16:11:28,903 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:11:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1318 transitions. [2022-04-07 16:11:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-07 16:11:28,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:28,905 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:28,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 16:11:28,905 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 85067346, now seen corresponding path program 2 times [2022-04-07 16:11:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:28,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988049401] [2022-04-07 16:11:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:29,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {31539#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {31532#true} is VALID [2022-04-07 16:11:29,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {31532#true} assume true; {31532#true} is VALID [2022-04-07 16:11:29,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31532#true} {31532#true} #593#return; {31532#true} is VALID [2022-04-07 16:11:29,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {31532#true} call ULTIMATE.init(); {31539#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:29,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {31539#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {31532#true} assume true; {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31532#true} {31532#true} #593#return; {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {31532#true} call #t~ret158 := main(); {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {31532#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; {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L272 TraceCheckUtils]: 6: Hoare triple {31532#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {31532#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; {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {31532#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; {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {31532#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31532#true} is VALID [2022-04-07 16:11:29,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {31532#true} assume !false; {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {31532#true} assume 12292 == #t~mem49;havoc #t~mem49; {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {31532#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; {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {31532#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {31532#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {31532#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {31532#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {31532#true} assume !(0 == ~tmp___4~0); {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {31532#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {31532#true} ~skip~0 := 0; {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {31532#true} assume !false; {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {31532#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {31532#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {31532#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {31532#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {31532#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {31532#true} assume 4368 == #t~mem54;havoc #t~mem54; {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {31532#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; {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {31532#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {31532#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; {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {31532#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {31532#true} ~skip~0 := 0; {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {31532#true} assume !false; {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {31532#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {31532#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {31532#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {31532#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {31532#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {31532#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {31532#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {31532#true} assume 4384 == #t~mem56;havoc #t~mem56; {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 50: Hoare triple {31532#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {31532#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {31532#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 53: Hoare triple {31532#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {31532#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {31532#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {31532#true} ~skip~0 := 0; {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {31532#true} assume !false; {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {31532#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 61: Hoare triple {31532#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 62: Hoare triple {31532#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,145 INFO L290 TraceCheckUtils]: 63: Hoare triple {31532#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 64: Hoare triple {31532#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 65: Hoare triple {31532#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 66: Hoare triple {31532#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 67: Hoare triple {31532#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 68: Hoare triple {31532#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 69: Hoare triple {31532#true} assume 4400 == #t~mem58;havoc #t~mem58; {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 70: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 71: Hoare triple {31532#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; {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 72: Hoare triple {31532#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 73: Hoare triple {31532#true} assume !(~ret~0 <= 0); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 74: Hoare triple {31532#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 75: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,146 INFO L290 TraceCheckUtils]: 76: Hoare triple {31532#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 77: Hoare triple {31532#true} ~skip~0 := 0; {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 78: Hoare triple {31532#true} assume !false; {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 79: Hoare triple {31532#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); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 80: Hoare triple {31532#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 81: Hoare triple {31532#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 82: Hoare triple {31532#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 83: Hoare triple {31532#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 84: Hoare triple {31532#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 85: Hoare triple {31532#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 86: Hoare triple {31532#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 87: Hoare triple {31532#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {31532#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {31532#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,148 INFO L290 TraceCheckUtils]: 90: Hoare triple {31532#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31532#true} is VALID [2022-04-07 16:11:29,148 INFO L290 TraceCheckUtils]: 91: Hoare triple {31532#true} assume 4416 == #t~mem60;havoc #t~mem60; {31532#true} is VALID [2022-04-07 16:11:29,148 INFO L290 TraceCheckUtils]: 92: Hoare triple {31532#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {31532#true} is VALID [2022-04-07 16:11:29,148 INFO L290 TraceCheckUtils]: 93: Hoare triple {31532#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {31532#true} is VALID [2022-04-07 16:11:29,149 INFO L290 TraceCheckUtils]: 94: Hoare triple {31532#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); {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:29,149 INFO L290 TraceCheckUtils]: 95: Hoare triple {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:29,149 INFO L290 TraceCheckUtils]: 96: Hoare triple {31537#(= 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); {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:29,150 INFO L290 TraceCheckUtils]: 97: Hoare triple {31537#(= 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; {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:29,150 INFO L290 TraceCheckUtils]: 98: Hoare triple {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:29,150 INFO L290 TraceCheckUtils]: 99: Hoare triple {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {31537#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:29,151 INFO L290 TraceCheckUtils]: 100: Hoare triple {31537#(= 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); {31538#(= |ssl3_connect_#t~mem49| 4432)} is VALID [2022-04-07 16:11:29,151 INFO L290 TraceCheckUtils]: 101: Hoare triple {31538#(= |ssl3_connect_#t~mem49| 4432)} assume 12292 == #t~mem49;havoc #t~mem49; {31533#false} is VALID [2022-04-07 16:11:29,151 INFO L290 TraceCheckUtils]: 102: Hoare triple {31533#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; {31533#false} is VALID [2022-04-07 16:11:29,151 INFO L290 TraceCheckUtils]: 103: Hoare triple {31533#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,151 INFO L290 TraceCheckUtils]: 104: Hoare triple {31533#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {31533#false} is VALID [2022-04-07 16:11:29,151 INFO L290 TraceCheckUtils]: 105: Hoare triple {31533#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,151 INFO L290 TraceCheckUtils]: 106: Hoare triple {31533#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); {31533#false} is VALID [2022-04-07 16:11:29,151 INFO L290 TraceCheckUtils]: 107: Hoare triple {31533#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 108: Hoare triple {31533#false} assume !(0 == ~tmp___4~0); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 109: Hoare triple {31533#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); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 110: Hoare triple {31533#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); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 111: Hoare triple {31533#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 112: Hoare triple {31533#false} ~skip~0 := 0; {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 113: Hoare triple {31533#false} assume !false; {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 114: Hoare triple {31533#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); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 115: Hoare triple {31533#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 116: Hoare triple {31533#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 117: Hoare triple {31533#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 118: Hoare triple {31533#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 119: Hoare triple {31533#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 120: Hoare triple {31533#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,152 INFO L290 TraceCheckUtils]: 121: Hoare triple {31533#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 122: Hoare triple {31533#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 123: Hoare triple {31533#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 124: Hoare triple {31533#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 125: Hoare triple {31533#false} assume 4401 == #t~mem59;havoc #t~mem59; {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 126: Hoare triple {31533#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); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 127: Hoare triple {31533#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;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 128: Hoare triple {31533#false} assume !(2 == ~blastFlag~0); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 129: Hoare triple {31533#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 130: Hoare triple {31533#false} assume !(~ret~0 <= 0); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 131: Hoare triple {31533#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 132: Hoare triple {31533#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); {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 133: Hoare triple {31533#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {31533#false} is VALID [2022-04-07 16:11:29,153 INFO L290 TraceCheckUtils]: 134: Hoare triple {31533#false} ~skip~0 := 0; {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 135: Hoare triple {31533#false} assume !false; {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 136: Hoare triple {31533#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); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 137: Hoare triple {31533#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 138: Hoare triple {31533#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 139: Hoare triple {31533#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 140: Hoare triple {31533#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 141: Hoare triple {31533#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 142: Hoare triple {31533#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 143: Hoare triple {31533#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 144: Hoare triple {31533#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 145: Hoare triple {31533#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 146: Hoare triple {31533#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 147: Hoare triple {31533#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,154 INFO L290 TraceCheckUtils]: 148: Hoare triple {31533#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,155 INFO L290 TraceCheckUtils]: 149: Hoare triple {31533#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31533#false} is VALID [2022-04-07 16:11:29,155 INFO L290 TraceCheckUtils]: 150: Hoare triple {31533#false} assume 4432 == #t~mem62;havoc #t~mem62; {31533#false} is VALID [2022-04-07 16:11:29,155 INFO L290 TraceCheckUtils]: 151: Hoare triple {31533#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {31533#false} is VALID [2022-04-07 16:11:29,155 INFO L290 TraceCheckUtils]: 152: Hoare triple {31533#false} assume 5 == ~blastFlag~0; {31533#false} is VALID [2022-04-07 16:11:29,155 INFO L290 TraceCheckUtils]: 153: Hoare triple {31533#false} assume !false; {31533#false} is VALID [2022-04-07 16:11:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-07 16:11:29,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:29,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988049401] [2022-04-07 16:11:29,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988049401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:29,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:29,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:29,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326864829] [2022-04-07 16:11:29,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:29,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2022-04-07 16:11:29,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:29,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states 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:11:29,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:29,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:29,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:29,239 INFO L87 Difference]: Start difference. First operand 886 states and 1318 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states 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:11:31,266 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:11:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:32,653 INFO L93 Difference]: Finished difference Result 2010 states and 2981 transitions. [2022-04-07 16:11:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:32,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 154 [2022-04-07 16:11:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states 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:11:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-07 16:11:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states 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:11:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-07 16:11:32,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-07 16:11:32,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:32,999 INFO L225 Difference]: With dead ends: 2010 [2022-04-07 16:11:32,999 INFO L226 Difference]: Without dead ends: 1140 [2022-04-07 16:11:33,001 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:11:33,001 INFO L913 BasicCegarLoop]: 235 mSDtfsCounter, 98 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:33,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 559 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:11:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-04-07 16:11:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 886. [2022-04-07 16:11:33,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:33,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1140 states. Second operand has 886 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:33,023 INFO L74 IsIncluded]: Start isIncluded. First operand 1140 states. Second operand has 886 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:33,024 INFO L87 Difference]: Start difference. First operand 1140 states. Second operand has 886 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:33,085 INFO L93 Difference]: Finished difference Result 1140 states and 1679 transitions. [2022-04-07 16:11:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1679 transitions. [2022-04-07 16:11:33,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:33,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:33,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1140 states. [2022-04-07 16:11:33,089 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1140 states. [2022-04-07 16:11:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:33,133 INFO L93 Difference]: Finished difference Result 1140 states and 1679 transitions. [2022-04-07 16:11:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1679 transitions. [2022-04-07 16:11:33,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:33,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:33,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:33,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4869466515323495) internal successors, (1310), 881 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1314 transitions. [2022-04-07 16:11:33,178 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1314 transitions. Word has length 154 [2022-04-07 16:11:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:33,178 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1314 transitions. [2022-04-07 16:11:33,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states 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:11:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1314 transitions. [2022-04-07 16:11:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-07 16:11:33,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:33,180 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:33,180 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 16:11:33,181 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:33,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1065118499, now seen corresponding path program 1 times [2022-04-07 16:11:33,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:33,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106195653] [2022-04-07 16:11:33,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:33,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:33,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {37098#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {37091#true} is VALID [2022-04-07 16:11:33,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {37091#true} assume true; {37091#true} is VALID [2022-04-07 16:11:33,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37091#true} {37091#true} #593#return; {37091#true} is VALID [2022-04-07 16:11:33,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {37091#true} call ULTIMATE.init(); {37098#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:33,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {37098#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {37091#true} is VALID [2022-04-07 16:11:33,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {37091#true} assume true; {37091#true} is VALID [2022-04-07 16:11:33,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37091#true} {37091#true} #593#return; {37091#true} is VALID [2022-04-07 16:11:33,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {37091#true} call #t~ret158 := main(); {37091#true} is VALID [2022-04-07 16:11:33,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {37091#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; {37091#true} is VALID [2022-04-07 16:11:33,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {37091#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37091#true} is VALID [2022-04-07 16:11:33,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {37091#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; {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {37091#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; {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {37091#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {37091#true} assume !false; {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {37091#true} assume 12292 == #t~mem49;havoc #t~mem49; {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {37091#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; {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {37091#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {37091#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {37091#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {37091#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {37091#true} is VALID [2022-04-07 16:11:33,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {37091#true} assume !(0 == ~tmp___4~0); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {37091#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {37091#true} ~skip~0 := 0; {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {37091#true} assume !false; {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {37091#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {37091#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {37091#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {37091#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {37091#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {37091#true} assume 4368 == #t~mem54;havoc #t~mem54; {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {37091#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; {37091#true} is VALID [2022-04-07 16:11:33,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {37091#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {37091#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; {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {37091#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {37091#true} ~skip~0 := 0; {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {37091#true} assume !false; {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {37091#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {37091#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {37091#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {37091#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {37091#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {37091#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {37091#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {37091#true} assume 4384 == #t~mem56;havoc #t~mem56; {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {37091#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {37091#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {37091#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {37091#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {37091#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {37091#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {37091#true} ~skip~0 := 0; {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {37091#true} assume !false; {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {37091#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {37091#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {37091#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {37091#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {37091#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {37091#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {37091#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {37091#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {37091#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {37091#true} assume 4400 == #t~mem58;havoc #t~mem58; {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {37091#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; {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {37091#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {37091#true} assume !(~ret~0 <= 0); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {37091#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,401 INFO L290 TraceCheckUtils]: 75: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {37091#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {37091#true} ~skip~0 := 0; {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 78: Hoare triple {37091#true} assume !false; {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 79: Hoare triple {37091#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); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 80: Hoare triple {37091#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 81: Hoare triple {37091#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 82: Hoare triple {37091#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 83: Hoare triple {37091#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {37091#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 85: Hoare triple {37091#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 86: Hoare triple {37091#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 87: Hoare triple {37091#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {37091#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {37091#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,403 INFO L290 TraceCheckUtils]: 90: Hoare triple {37091#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37091#true} is VALID [2022-04-07 16:11:33,403 INFO L290 TraceCheckUtils]: 91: Hoare triple {37091#true} assume 4416 == #t~mem60;havoc #t~mem60; {37091#true} is VALID [2022-04-07 16:11:33,403 INFO L290 TraceCheckUtils]: 92: Hoare triple {37091#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37091#true} is VALID [2022-04-07 16:11:33,403 INFO L290 TraceCheckUtils]: 93: Hoare triple {37091#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37091#true} is VALID [2022-04-07 16:11:33,404 INFO L290 TraceCheckUtils]: 94: Hoare triple {37091#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); {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:33,404 INFO L290 TraceCheckUtils]: 95: Hoare triple {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:33,405 INFO L290 TraceCheckUtils]: 96: Hoare triple {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:33,405 INFO L290 TraceCheckUtils]: 97: Hoare triple {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:33,405 INFO L290 TraceCheckUtils]: 98: Hoare triple {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:33,406 INFO L290 TraceCheckUtils]: 99: Hoare triple {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:33,406 INFO L290 TraceCheckUtils]: 100: Hoare triple {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:33,407 INFO L290 TraceCheckUtils]: 101: Hoare triple {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:33,407 INFO L290 TraceCheckUtils]: 102: Hoare triple {37096#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37097#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-07 16:11:33,407 INFO L290 TraceCheckUtils]: 103: Hoare triple {37097#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {37092#false} is VALID [2022-04-07 16:11:33,407 INFO L290 TraceCheckUtils]: 104: Hoare triple {37092#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 105: Hoare triple {37092#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 106: Hoare triple {37092#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 107: Hoare triple {37092#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); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 108: Hoare triple {37092#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 109: Hoare triple {37092#false} assume !(0 == ~tmp___4~0); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 110: Hoare triple {37092#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); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 111: Hoare triple {37092#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); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 112: Hoare triple {37092#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 113: Hoare triple {37092#false} ~skip~0 := 0; {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 114: Hoare triple {37092#false} assume !false; {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 115: Hoare triple {37092#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); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 116: Hoare triple {37092#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 117: Hoare triple {37092#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,408 INFO L290 TraceCheckUtils]: 118: Hoare triple {37092#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 119: Hoare triple {37092#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 120: Hoare triple {37092#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 121: Hoare triple {37092#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 122: Hoare triple {37092#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 123: Hoare triple {37092#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 124: Hoare triple {37092#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 125: Hoare triple {37092#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 126: Hoare triple {37092#false} assume 4401 == #t~mem59;havoc #t~mem59; {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 127: Hoare triple {37092#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); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 128: Hoare triple {37092#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;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 129: Hoare triple {37092#false} assume !(2 == ~blastFlag~0); {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 130: Hoare triple {37092#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37092#false} is VALID [2022-04-07 16:11:33,409 INFO L290 TraceCheckUtils]: 131: Hoare triple {37092#false} assume !(~ret~0 <= 0); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 132: Hoare triple {37092#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 133: Hoare triple {37092#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); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 134: Hoare triple {37092#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 135: Hoare triple {37092#false} ~skip~0 := 0; {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 136: Hoare triple {37092#false} assume !false; {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 137: Hoare triple {37092#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); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 138: Hoare triple {37092#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 139: Hoare triple {37092#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 140: Hoare triple {37092#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 141: Hoare triple {37092#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 142: Hoare triple {37092#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 143: Hoare triple {37092#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,410 INFO L290 TraceCheckUtils]: 144: Hoare triple {37092#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 145: Hoare triple {37092#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 146: Hoare triple {37092#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 147: Hoare triple {37092#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 148: Hoare triple {37092#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 149: Hoare triple {37092#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 150: Hoare triple {37092#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 151: Hoare triple {37092#false} assume 4432 == #t~mem62;havoc #t~mem62; {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 152: Hoare triple {37092#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 153: Hoare triple {37092#false} assume 5 == ~blastFlag~0; {37092#false} is VALID [2022-04-07 16:11:33,411 INFO L290 TraceCheckUtils]: 154: Hoare triple {37092#false} assume !false; {37092#false} is VALID [2022-04-07 16:11:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-07 16:11:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:33,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106195653] [2022-04-07 16:11:33,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106195653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:33,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:33,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:33,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241255002] [2022-04-07 16:11:33,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:33,414 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 155 [2022-04-07 16:11:33,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:33,415 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:11:33,507 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:11:33,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:33,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:33,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:33,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:33,508 INFO L87 Difference]: Start difference. First operand 886 states and 1314 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:11:35,535 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:11:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:36,702 INFO L93 Difference]: Finished difference Result 2134 states and 3161 transitions. [2022-04-07 16:11:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:36,702 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 155 [2022-04-07 16:11:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:36,702 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:11:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:11:36,705 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:11:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-07 16:11:36,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-07 16:11:37,026 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:11:37,082 INFO L225 Difference]: With dead ends: 2134 [2022-04-07 16:11:37,083 INFO L226 Difference]: Without dead ends: 1264 [2022-04-07 16:11:37,084 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:11:37,084 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 116 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:37,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 300 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 394 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-04-07 16:11:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 886. [2022-04-07 16:11:37,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:37,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1264 states. Second operand has 886 states, 881 states have (on average 1.47105561861521) internal successors, (1296), 881 states have internal predecessors, (1296), 3 states have call successors, (3), 3 states 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:11:37,108 INFO L74 IsIncluded]: Start isIncluded. First operand 1264 states. Second operand has 886 states, 881 states have (on average 1.47105561861521) internal successors, (1296), 881 states have internal predecessors, (1296), 3 states have call successors, (3), 3 states 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:11:37,109 INFO L87 Difference]: Start difference. First operand 1264 states. Second operand has 886 states, 881 states have (on average 1.47105561861521) internal successors, (1296), 881 states have internal predecessors, (1296), 3 states have call successors, (3), 3 states 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:11:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:37,179 INFO L93 Difference]: Finished difference Result 1264 states and 1853 transitions. [2022-04-07 16:11:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1853 transitions. [2022-04-07 16:11:37,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:37,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:37,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.47105561861521) internal successors, (1296), 881 states have internal predecessors, (1296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1264 states. [2022-04-07 16:11:37,183 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.47105561861521) internal successors, (1296), 881 states have internal predecessors, (1296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1264 states. [2022-04-07 16:11:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:37,234 INFO L93 Difference]: Finished difference Result 1264 states and 1853 transitions. [2022-04-07 16:11:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1853 transitions. [2022-04-07 16:11:37,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:37,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:37,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:37,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.47105561861521) internal successors, (1296), 881 states have internal predecessors, (1296), 3 states have call successors, (3), 3 states 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:11:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1300 transitions. [2022-04-07 16:11:37,281 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1300 transitions. Word has length 155 [2022-04-07 16:11:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:37,281 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1300 transitions. [2022-04-07 16:11:37,282 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:11:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1300 transitions. [2022-04-07 16:11:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-07 16:11:37,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:37,284 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:37,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 16:11:37,284 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1761005295, now seen corresponding path program 1 times [2022-04-07 16:11:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:37,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741634981] [2022-04-07 16:11:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:37,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:37,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {43052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {43045#true} is VALID [2022-04-07 16:11:37,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {43045#true} assume true; {43045#true} is VALID [2022-04-07 16:11:37,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43045#true} {43045#true} #593#return; {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {43045#true} call ULTIMATE.init(); {43052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:37,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {43052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {43045#true} assume true; {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43045#true} {43045#true} #593#return; {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {43045#true} call #t~ret158 := main(); {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {43045#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; {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {43045#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {43045#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; {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {43045#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; {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {43045#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {43045#true} is VALID [2022-04-07 16:11:37,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {43045#true} assume !false; {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {43045#true} assume 12292 == #t~mem49;havoc #t~mem49; {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {43045#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; {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {43045#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {43045#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {43045#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {43045#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {43045#true} assume !(0 == ~tmp___4~0); {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {43045#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {43045#true} ~skip~0 := 0; {43045#true} is VALID [2022-04-07 16:11:37,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {43045#true} assume !false; {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {43045#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {43045#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {43045#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {43045#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {43045#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {43045#true} assume 4368 == #t~mem54;havoc #t~mem54; {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {43045#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; {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {43045#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {43045#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; {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {43045#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {43045#true} is VALID [2022-04-07 16:11:37,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {43045#true} ~skip~0 := 0; {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {43045#true} assume !false; {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {43045#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {43045#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {43045#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {43045#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {43045#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {43045#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {43045#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {43045#true} assume 4384 == #t~mem56;havoc #t~mem56; {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {43045#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {43045#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {43045#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {43045#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {43045#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {43045#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {43045#true} ~skip~0 := 0; {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {43045#true} assume !false; {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {43045#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {43045#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 62: Hoare triple {43045#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {43045#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {43045#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {43045#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {43045#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 67: Hoare triple {43045#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {43045#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 69: Hoare triple {43045#true} assume 4400 == #t~mem58;havoc #t~mem58; {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 70: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {43045#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; {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {43045#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {43045#true} assume !(~ret~0 <= 0); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 74: Hoare triple {43045#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 75: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 76: Hoare triple {43045#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 77: Hoare triple {43045#true} ~skip~0 := 0; {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 78: Hoare triple {43045#true} assume !false; {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 79: Hoare triple {43045#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); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 80: Hoare triple {43045#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,519 INFO L290 TraceCheckUtils]: 81: Hoare triple {43045#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 82: Hoare triple {43045#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 83: Hoare triple {43045#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 84: Hoare triple {43045#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 85: Hoare triple {43045#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 86: Hoare triple {43045#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 87: Hoare triple {43045#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 88: Hoare triple {43045#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 89: Hoare triple {43045#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 90: Hoare triple {43045#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 91: Hoare triple {43045#true} assume 4416 == #t~mem60;havoc #t~mem60; {43045#true} is VALID [2022-04-07 16:11:37,520 INFO L290 TraceCheckUtils]: 92: Hoare triple {43045#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {43045#true} is VALID [2022-04-07 16:11:37,521 INFO L290 TraceCheckUtils]: 93: Hoare triple {43045#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {43045#true} is VALID [2022-04-07 16:11:37,522 INFO L290 TraceCheckUtils]: 94: Hoare triple {43045#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); {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,522 INFO L290 TraceCheckUtils]: 95: Hoare triple {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,522 INFO L290 TraceCheckUtils]: 96: Hoare triple {43050#(= 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); {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,523 INFO L290 TraceCheckUtils]: 97: Hoare triple {43050#(= 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; {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,523 INFO L290 TraceCheckUtils]: 98: Hoare triple {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,523 INFO L290 TraceCheckUtils]: 99: Hoare triple {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,524 INFO L290 TraceCheckUtils]: 100: Hoare triple {43050#(= 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); {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,524 INFO L290 TraceCheckUtils]: 101: Hoare triple {43050#(= 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); {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,524 INFO L290 TraceCheckUtils]: 102: Hoare triple {43050#(= 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); {43050#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 103: Hoare triple {43050#(= 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); {43051#(= |ssl3_connect_#t~mem52| 4432)} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 104: Hoare triple {43051#(= |ssl3_connect_#t~mem52| 4432)} assume 20480 == #t~mem52;havoc #t~mem52; {43046#false} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 105: Hoare triple {43046#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 106: Hoare triple {43046#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {43046#false} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 107: Hoare triple {43046#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 108: Hoare triple {43046#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); {43046#false} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 109: Hoare triple {43046#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {43046#false} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 110: Hoare triple {43046#false} assume !(0 == ~tmp___4~0); {43046#false} is VALID [2022-04-07 16:11:37,525 INFO L290 TraceCheckUtils]: 111: Hoare triple {43046#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); {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 112: Hoare triple {43046#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); {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 113: Hoare triple {43046#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 114: Hoare triple {43046#false} ~skip~0 := 0; {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 115: Hoare triple {43046#false} assume !false; {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 116: Hoare triple {43046#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); {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 117: Hoare triple {43046#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 118: Hoare triple {43046#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 119: Hoare triple {43046#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 120: Hoare triple {43046#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 121: Hoare triple {43046#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,526 INFO L290 TraceCheckUtils]: 122: Hoare triple {43046#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 123: Hoare triple {43046#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 124: Hoare triple {43046#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 125: Hoare triple {43046#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 126: Hoare triple {43046#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 127: Hoare triple {43046#false} assume 4401 == #t~mem59;havoc #t~mem59; {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 128: Hoare triple {43046#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); {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 129: Hoare triple {43046#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;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 130: Hoare triple {43046#false} assume !(2 == ~blastFlag~0); {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 131: Hoare triple {43046#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 132: Hoare triple {43046#false} assume !(~ret~0 <= 0); {43046#false} is VALID [2022-04-07 16:11:37,527 INFO L290 TraceCheckUtils]: 133: Hoare triple {43046#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 134: Hoare triple {43046#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); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 135: Hoare triple {43046#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 136: Hoare triple {43046#false} ~skip~0 := 0; {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 137: Hoare triple {43046#false} assume !false; {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 138: Hoare triple {43046#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); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 139: Hoare triple {43046#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 140: Hoare triple {43046#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 141: Hoare triple {43046#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 142: Hoare triple {43046#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 143: Hoare triple {43046#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 144: Hoare triple {43046#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,528 INFO L290 TraceCheckUtils]: 145: Hoare triple {43046#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 146: Hoare triple {43046#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 147: Hoare triple {43046#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 148: Hoare triple {43046#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 149: Hoare triple {43046#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 150: Hoare triple {43046#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 151: Hoare triple {43046#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 152: Hoare triple {43046#false} assume 4432 == #t~mem62;havoc #t~mem62; {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 153: Hoare triple {43046#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 154: Hoare triple {43046#false} assume 5 == ~blastFlag~0; {43046#false} is VALID [2022-04-07 16:11:37,529 INFO L290 TraceCheckUtils]: 155: Hoare triple {43046#false} assume !false; {43046#false} is VALID [2022-04-07 16:11:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-07 16:11:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:37,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741634981] [2022-04-07 16:11:37,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741634981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:37,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:37,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97976217] [2022-04-07 16:11:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:37,531 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 156 [2022-04-07 16:11:37,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:37,532 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:11:37,620 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:11:37,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:37,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:37,621 INFO L87 Difference]: Start difference. First operand 886 states and 1300 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:11:39,649 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:11:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:40,982 INFO L93 Difference]: Finished difference Result 1974 states and 2901 transitions. [2022-04-07 16:11:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:40,983 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 156 [2022-04-07 16:11:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:40,983 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:11:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2022-04-07 16:11:40,985 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:11:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2022-04-07 16:11:40,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 448 transitions. [2022-04-07 16:11:41,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:41,326 INFO L225 Difference]: With dead ends: 1974 [2022-04-07 16:11:41,326 INFO L226 Difference]: Without dead ends: 1104 [2022-04-07 16:11:41,327 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:11:41,328 INFO L913 BasicCegarLoop]: 227 mSDtfsCounter, 86 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:41,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 543 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-04-07 16:11:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 886. [2022-04-07 16:11:41,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:41,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4665153234960273) internal successors, (1292), 881 states have internal predecessors, (1292), 3 states have call successors, (3), 3 states 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:11:41,349 INFO L74 IsIncluded]: Start isIncluded. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4665153234960273) internal successors, (1292), 881 states have internal predecessors, (1292), 3 states have call successors, (3), 3 states 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:11:41,350 INFO L87 Difference]: Start difference. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4665153234960273) internal successors, (1292), 881 states have internal predecessors, (1292), 3 states have call successors, (3), 3 states 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:11:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:41,405 INFO L93 Difference]: Finished difference Result 1104 states and 1617 transitions. [2022-04-07 16:11:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1617 transitions. [2022-04-07 16:11:41,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:41,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:41,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4665153234960273) internal successors, (1292), 881 states have internal predecessors, (1292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1104 states. [2022-04-07 16:11:41,408 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4665153234960273) internal successors, (1292), 881 states have internal predecessors, (1292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1104 states. [2022-04-07 16:11:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:41,467 INFO L93 Difference]: Finished difference Result 1104 states and 1617 transitions. [2022-04-07 16:11:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1617 transitions. [2022-04-07 16:11:41,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:41,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:41,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:41,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4665153234960273) internal successors, (1292), 881 states have internal predecessors, (1292), 3 states have call successors, (3), 3 states 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:11:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2022-04-07 16:11:41,511 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 156 [2022-04-07 16:11:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:41,512 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2022-04-07 16:11:41,512 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:11:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2022-04-07 16:11:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-07 16:11:41,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:41,514 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:41,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 16:11:41,514 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1472512973, now seen corresponding path program 1 times [2022-04-07 16:11:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:41,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587704196] [2022-04-07 16:11:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:41,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:41,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {48499#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {48492#true} is VALID [2022-04-07 16:11:41,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {48492#true} assume true; {48492#true} is VALID [2022-04-07 16:11:41,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48492#true} {48492#true} #593#return; {48492#true} is VALID [2022-04-07 16:11:41,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {48492#true} call ULTIMATE.init(); {48499#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:41,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {48499#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {48492#true} assume true; {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48492#true} {48492#true} #593#return; {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {48492#true} call #t~ret158 := main(); {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {48492#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; {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {48492#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {48492#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; {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {48492#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; {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {48492#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {48492#true} assume !false; {48492#true} is VALID [2022-04-07 16:11:41,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {48492#true} assume 12292 == #t~mem49;havoc #t~mem49; {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {48492#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; {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {48492#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {48492#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {48492#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {48492#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {48492#true} assume !(0 == ~tmp___4~0); {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {48492#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {48492#true} ~skip~0 := 0; {48492#true} is VALID [2022-04-07 16:11:41,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {48492#true} assume !false; {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {48492#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {48492#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {48492#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {48492#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {48492#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {48492#true} assume 4368 == #t~mem54;havoc #t~mem54; {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {48492#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; {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {48492#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {48492#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; {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {48492#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {48492#true} ~skip~0 := 0; {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {48492#true} assume !false; {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {48492#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {48492#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {48492#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {48492#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {48492#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {48492#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {48492#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {48492#true} assume 4384 == #t~mem56;havoc #t~mem56; {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {48492#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {48492#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48492#true} is VALID [2022-04-07 16:11:41,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {48492#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {48492#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {48492#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {48492#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {48492#true} ~skip~0 := 0; {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {48492#true} assume !false; {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {48492#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {48492#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {48492#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {48492#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {48492#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {48492#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {48492#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {48492#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 68: Hoare triple {48492#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {48492#true} assume 4400 == #t~mem58;havoc #t~mem58; {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 71: Hoare triple {48492#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; {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 72: Hoare triple {48492#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 73: Hoare triple {48492#true} assume !(~ret~0 <= 0); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 74: Hoare triple {48492#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 76: Hoare triple {48492#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 77: Hoare triple {48492#true} ~skip~0 := 0; {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 78: Hoare triple {48492#true} assume !false; {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 79: Hoare triple {48492#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); {48492#true} is VALID [2022-04-07 16:11:41,744 INFO L290 TraceCheckUtils]: 80: Hoare triple {48492#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 81: Hoare triple {48492#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 82: Hoare triple {48492#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 83: Hoare triple {48492#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 84: Hoare triple {48492#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 85: Hoare triple {48492#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 86: Hoare triple {48492#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 87: Hoare triple {48492#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 88: Hoare triple {48492#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 89: Hoare triple {48492#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 90: Hoare triple {48492#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 91: Hoare triple {48492#true} assume 4416 == #t~mem60;havoc #t~mem60; {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 92: Hoare triple {48492#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {48492#true} is VALID [2022-04-07 16:11:41,745 INFO L290 TraceCheckUtils]: 93: Hoare triple {48492#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {48492#true} is VALID [2022-04-07 16:11:41,747 INFO L290 TraceCheckUtils]: 94: Hoare triple {48492#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); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,747 INFO L290 TraceCheckUtils]: 95: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,747 INFO L290 TraceCheckUtils]: 96: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,748 INFO L290 TraceCheckUtils]: 97: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,748 INFO L290 TraceCheckUtils]: 98: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,749 INFO L290 TraceCheckUtils]: 99: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,749 INFO L290 TraceCheckUtils]: 100: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,749 INFO L290 TraceCheckUtils]: 101: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,750 INFO L290 TraceCheckUtils]: 102: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,750 INFO L290 TraceCheckUtils]: 103: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,750 INFO L290 TraceCheckUtils]: 104: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,751 INFO L290 TraceCheckUtils]: 105: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,751 INFO L290 TraceCheckUtils]: 106: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 107: Hoare triple {48497#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48498#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 108: Hoare triple {48498#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {48493#false} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 109: Hoare triple {48493#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48493#false} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 110: Hoare triple {48493#false} assume !(1 == ~blastFlag~0); {48493#false} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 111: Hoare triple {48493#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 112: Hoare triple {48493#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 113: Hoare triple {48493#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 114: Hoare triple {48493#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); {48493#false} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 115: Hoare triple {48493#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48493#false} is VALID [2022-04-07 16:11:41,752 INFO L290 TraceCheckUtils]: 116: Hoare triple {48493#false} ~skip~0 := 0; {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 117: Hoare triple {48493#false} assume !false; {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 118: Hoare triple {48493#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); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 119: Hoare triple {48493#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 120: Hoare triple {48493#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 121: Hoare triple {48493#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 122: Hoare triple {48493#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 123: Hoare triple {48493#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 124: Hoare triple {48493#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 125: Hoare triple {48493#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 126: Hoare triple {48493#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 127: Hoare triple {48493#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 128: Hoare triple {48493#false} assume 4400 == #t~mem58;havoc #t~mem58; {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 129: Hoare triple {48493#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); {48493#false} is VALID [2022-04-07 16:11:41,753 INFO L290 TraceCheckUtils]: 130: Hoare triple {48493#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;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 131: Hoare triple {48493#false} assume !(2 == ~blastFlag~0); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 132: Hoare triple {48493#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 133: Hoare triple {48493#false} assume !(~ret~0 <= 0); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 134: Hoare triple {48493#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 135: Hoare triple {48493#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); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 136: Hoare triple {48493#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 137: Hoare triple {48493#false} ~skip~0 := 0; {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 138: Hoare triple {48493#false} assume !false; {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 139: Hoare triple {48493#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); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 140: Hoare triple {48493#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 141: Hoare triple {48493#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 142: Hoare triple {48493#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 143: Hoare triple {48493#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,754 INFO L290 TraceCheckUtils]: 144: Hoare triple {48493#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 145: Hoare triple {48493#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 146: Hoare triple {48493#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 147: Hoare triple {48493#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 148: Hoare triple {48493#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 149: Hoare triple {48493#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 150: Hoare triple {48493#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 151: Hoare triple {48493#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 152: Hoare triple {48493#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 153: Hoare triple {48493#false} assume 4432 == #t~mem62;havoc #t~mem62; {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 154: Hoare triple {48493#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 155: Hoare triple {48493#false} assume 5 == ~blastFlag~0; {48493#false} is VALID [2022-04-07 16:11:41,755 INFO L290 TraceCheckUtils]: 156: Hoare triple {48493#false} assume !false; {48493#false} is VALID [2022-04-07 16:11:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-07 16:11:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587704196] [2022-04-07 16:11:41,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587704196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:41,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:41,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347125820] [2022-04-07 16:11:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:41,757 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 157 [2022-04-07 16:11:41,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:41,757 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:11:41,850 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:11:41,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:41,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:41,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:41,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:41,851 INFO L87 Difference]: Start difference. First operand 886 states and 1296 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:11:43,878 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:11:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:44,937 INFO L93 Difference]: Finished difference Result 2134 states and 3125 transitions. [2022-04-07 16:11:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:44,937 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 157 [2022-04-07 16:11:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:44,937 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:11:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:11:44,940 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:11:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:11:44,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-07 16:11:45,271 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:11:45,322 INFO L225 Difference]: With dead ends: 2134 [2022-04-07 16:11:45,322 INFO L226 Difference]: Without dead ends: 1264 [2022-04-07 16:11:45,323 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:11:45,324 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:45,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-04-07 16:11:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 901. [2022-04-07 16:11:45,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:45,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1264 states. Second operand has 901 states, 896 states have (on average 1.4598214285714286) internal successors, (1308), 896 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,348 INFO L74 IsIncluded]: Start isIncluded. First operand 1264 states. Second operand has 901 states, 896 states have (on average 1.4598214285714286) internal successors, (1308), 896 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,349 INFO L87 Difference]: Start difference. First operand 1264 states. Second operand has 901 states, 896 states have (on average 1.4598214285714286) internal successors, (1308), 896 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:45,421 INFO L93 Difference]: Finished difference Result 1264 states and 1835 transitions. [2022-04-07 16:11:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1835 transitions. [2022-04-07 16:11:45,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:45,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:45,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 901 states, 896 states have (on average 1.4598214285714286) internal successors, (1308), 896 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1264 states. [2022-04-07 16:11:45,425 INFO L87 Difference]: Start difference. First operand has 901 states, 896 states have (on average 1.4598214285714286) internal successors, (1308), 896 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1264 states. [2022-04-07 16:11:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:45,500 INFO L93 Difference]: Finished difference Result 1264 states and 1835 transitions. [2022-04-07 16:11:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1835 transitions. [2022-04-07 16:11:45,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:45,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:45,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:45,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 896 states have (on average 1.4598214285714286) internal successors, (1308), 896 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1312 transitions. [2022-04-07 16:11:45,547 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1312 transitions. Word has length 157 [2022-04-07 16:11:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:45,547 INFO L478 AbstractCegarLoop]: Abstraction has 901 states and 1312 transitions. [2022-04-07 16:11:45,548 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:11:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1312 transitions. [2022-04-07 16:11:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-07 16:11:45,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:45,550 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:11:45,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 16:11:45,550 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1600786980, now seen corresponding path program 1 times [2022-04-07 16:11:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:45,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652860954] [2022-04-07 16:11:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:45,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {54468#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {54461#true} is VALID [2022-04-07 16:11:45,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {54461#true} assume true; {54461#true} is VALID [2022-04-07 16:11:45,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54461#true} {54461#true} #593#return; {54461#true} is VALID [2022-04-07 16:11:45,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {54461#true} call ULTIMATE.init(); {54468#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:45,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {54468#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {54461#true} is VALID [2022-04-07 16:11:45,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {54461#true} assume true; {54461#true} is VALID [2022-04-07 16:11:45,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54461#true} {54461#true} #593#return; {54461#true} is VALID [2022-04-07 16:11:45,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {54461#true} call #t~ret158 := main(); {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {54461#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; {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {54461#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {54461#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; {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {54461#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; {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {54461#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {54461#true} assume !false; {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {54461#true} assume 12292 == #t~mem49;havoc #t~mem49; {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {54461#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; {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {54461#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {54461#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {54461#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {54461#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {54461#true} assume !(0 == ~tmp___4~0); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {54461#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {54461#true} ~skip~0 := 0; {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {54461#true} assume !false; {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {54461#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {54461#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {54461#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {54461#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {54461#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {54461#true} assume 4368 == #t~mem54;havoc #t~mem54; {54461#true} is VALID [2022-04-07 16:11:45,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {54461#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; {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {54461#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {54461#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; {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {54461#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {54461#true} ~skip~0 := 0; {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {54461#true} assume !false; {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {54461#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {54461#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {54461#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {54461#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {54461#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {54461#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {54461#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {54461#true} assume 4384 == #t~mem56;havoc #t~mem56; {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 50: Hoare triple {54461#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 51: Hoare triple {54461#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 52: Hoare triple {54461#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {54461#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {54461#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {54461#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {54461#true} ~skip~0 := 0; {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {54461#true} assume !false; {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {54461#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {54461#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {54461#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {54461#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {54461#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {54461#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {54461#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 67: Hoare triple {54461#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 68: Hoare triple {54461#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 69: Hoare triple {54461#true} assume 4400 == #t~mem58;havoc #t~mem58; {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {54461#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; {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {54461#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {54461#true} assume !(~ret~0 <= 0); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {54461#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {54461#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {54461#true} ~skip~0 := 0; {54461#true} is VALID [2022-04-07 16:11:45,754 INFO L290 TraceCheckUtils]: 78: Hoare triple {54461#true} assume !false; {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 79: Hoare triple {54461#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); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 80: Hoare triple {54461#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 81: Hoare triple {54461#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 82: Hoare triple {54461#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 83: Hoare triple {54461#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {54461#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {54461#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {54461#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {54461#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {54461#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 89: Hoare triple {54461#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 90: Hoare triple {54461#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 91: Hoare triple {54461#true} assume 4416 == #t~mem60;havoc #t~mem60; {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {54461#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {54461#true} is VALID [2022-04-07 16:11:45,755 INFO L290 TraceCheckUtils]: 93: Hoare triple {54461#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {54461#true} is VALID [2022-04-07 16:11:45,757 INFO L290 TraceCheckUtils]: 94: Hoare triple {54461#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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,757 INFO L290 TraceCheckUtils]: 95: Hoare triple {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,757 INFO L290 TraceCheckUtils]: 96: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,758 INFO L290 TraceCheckUtils]: 97: Hoare triple {54466#(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; {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,758 INFO L290 TraceCheckUtils]: 99: Hoare triple {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,758 INFO L290 TraceCheckUtils]: 100: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,759 INFO L290 TraceCheckUtils]: 101: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,759 INFO L290 TraceCheckUtils]: 102: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,759 INFO L290 TraceCheckUtils]: 103: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,759 INFO L290 TraceCheckUtils]: 104: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,760 INFO L290 TraceCheckUtils]: 105: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,760 INFO L290 TraceCheckUtils]: 106: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,760 INFO L290 TraceCheckUtils]: 107: Hoare triple {54466#(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); {54466#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:45,761 INFO L290 TraceCheckUtils]: 108: Hoare triple {54466#(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); {54467#(not (= |ssl3_connect_#t~mem57| 4385))} is VALID [2022-04-07 16:11:45,761 INFO L290 TraceCheckUtils]: 109: Hoare triple {54467#(not (= |ssl3_connect_#t~mem57| 4385))} assume 4385 == #t~mem57;havoc #t~mem57; {54462#false} is VALID [2022-04-07 16:11:45,761 INFO L290 TraceCheckUtils]: 110: Hoare triple {54462#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {54462#false} is VALID [2022-04-07 16:11:45,761 INFO L290 TraceCheckUtils]: 111: Hoare triple {54462#false} assume !(1 == ~blastFlag~0); {54462#false} is VALID [2022-04-07 16:11:45,761 INFO L290 TraceCheckUtils]: 112: Hoare triple {54462#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,761 INFO L290 TraceCheckUtils]: 113: Hoare triple {54462#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,761 INFO L290 TraceCheckUtils]: 114: Hoare triple {54462#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,761 INFO L290 TraceCheckUtils]: 115: Hoare triple {54462#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); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 116: Hoare triple {54462#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 117: Hoare triple {54462#false} ~skip~0 := 0; {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 118: Hoare triple {54462#false} assume !false; {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 119: Hoare triple {54462#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); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 120: Hoare triple {54462#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 121: Hoare triple {54462#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 122: Hoare triple {54462#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 123: Hoare triple {54462#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 124: Hoare triple {54462#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 125: Hoare triple {54462#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 126: Hoare triple {54462#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 127: Hoare triple {54462#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 128: Hoare triple {54462#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 129: Hoare triple {54462#false} assume 4400 == #t~mem58;havoc #t~mem58; {54462#false} is VALID [2022-04-07 16:11:45,762 INFO L290 TraceCheckUtils]: 130: Hoare triple {54462#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); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 131: Hoare triple {54462#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;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 132: Hoare triple {54462#false} assume !(2 == ~blastFlag~0); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 133: Hoare triple {54462#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 134: Hoare triple {54462#false} assume !(~ret~0 <= 0); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 135: Hoare triple {54462#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 136: Hoare triple {54462#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); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 137: Hoare triple {54462#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 138: Hoare triple {54462#false} ~skip~0 := 0; {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 139: Hoare triple {54462#false} assume !false; {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 140: Hoare triple {54462#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); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 141: Hoare triple {54462#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 142: Hoare triple {54462#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 143: Hoare triple {54462#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,763 INFO L290 TraceCheckUtils]: 144: Hoare triple {54462#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 145: Hoare triple {54462#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 146: Hoare triple {54462#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 147: Hoare triple {54462#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 148: Hoare triple {54462#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 149: Hoare triple {54462#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 150: Hoare triple {54462#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 151: Hoare triple {54462#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 152: Hoare triple {54462#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 153: Hoare triple {54462#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 154: Hoare triple {54462#false} assume 4432 == #t~mem62;havoc #t~mem62; {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 155: Hoare triple {54462#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 156: Hoare triple {54462#false} assume 5 == ~blastFlag~0; {54462#false} is VALID [2022-04-07 16:11:45,764 INFO L290 TraceCheckUtils]: 157: Hoare triple {54462#false} assume !false; {54462#false} is VALID [2022-04-07 16:11:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-07 16:11:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652860954] [2022-04-07 16:11:45,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652860954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:45,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:45,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766578964] [2022-04-07 16:11:45,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:45,767 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 158 [2022-04-07 16:11:45,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:45,767 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:11:45,859 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:11:45,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:45,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:45,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:45,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:45,860 INFO L87 Difference]: Start difference. First operand 901 states and 1312 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:11:47,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:49,044 INFO L93 Difference]: Finished difference Result 2145 states and 3122 transitions. [2022-04-07 16:11:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:49,044 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 158 [2022-04-07 16:11:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:49,045 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:11:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:11:49,047 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:11:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-07 16:11:49,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-07 16:11:49,385 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:11:49,436 INFO L225 Difference]: With dead ends: 2145 [2022-04-07 16:11:49,436 INFO L226 Difference]: Without dead ends: 1260 [2022-04-07 16:11:49,437 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:11:49,437 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 109 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:49,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 280 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-07 16:11:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 906. [2022-04-07 16:11:49,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:49,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1260 states. Second operand has 906 states, 901 states have (on average 1.4472807991120977) internal successors, (1304), 901 states have internal predecessors, (1304), 3 states have call successors, (3), 3 states 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:11:49,462 INFO L74 IsIncluded]: Start isIncluded. First operand 1260 states. Second operand has 906 states, 901 states have (on average 1.4472807991120977) internal successors, (1304), 901 states have internal predecessors, (1304), 3 states have call successors, (3), 3 states 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:11:49,463 INFO L87 Difference]: Start difference. First operand 1260 states. Second operand has 906 states, 901 states have (on average 1.4472807991120977) internal successors, (1304), 901 states have internal predecessors, (1304), 3 states have call successors, (3), 3 states 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:11:49,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:49,535 INFO L93 Difference]: Finished difference Result 1260 states and 1816 transitions. [2022-04-07 16:11:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1816 transitions. [2022-04-07 16:11:49,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:49,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:49,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 906 states, 901 states have (on average 1.4472807991120977) internal successors, (1304), 901 states have internal predecessors, (1304), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1260 states. [2022-04-07 16:11:49,538 INFO L87 Difference]: Start difference. First operand has 906 states, 901 states have (on average 1.4472807991120977) internal successors, (1304), 901 states have internal predecessors, (1304), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1260 states. [2022-04-07 16:11:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:49,613 INFO L93 Difference]: Finished difference Result 1260 states and 1816 transitions. [2022-04-07 16:11:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1816 transitions. [2022-04-07 16:11:49,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:49,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:49,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:49,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 901 states have (on average 1.4472807991120977) internal successors, (1304), 901 states have internal predecessors, (1304), 3 states have call successors, (3), 3 states 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:11:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1308 transitions. [2022-04-07 16:11:49,661 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1308 transitions. Word has length 158 [2022-04-07 16:11:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:49,662 INFO L478 AbstractCegarLoop]: Abstraction has 906 states and 1308 transitions. [2022-04-07 16:11:49,662 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:11:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1308 transitions. [2022-04-07 16:11:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-07 16:11:49,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:49,664 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:49,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 16:11:49,664 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash -500107939, now seen corresponding path program 1 times [2022-04-07 16:11:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:49,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731186099] [2022-04-07 16:11:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:49,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:49,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {60447#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {60437#true} is VALID [2022-04-07 16:11:49,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {60437#true} assume true; {60437#true} is VALID [2022-04-07 16:11:49,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60437#true} {60437#true} #593#return; {60437#true} is VALID [2022-04-07 16:11:49,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {60437#true} call ULTIMATE.init(); {60447#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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:11:49,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {60447#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {60437#true} assume true; {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60437#true} {60437#true} #593#return; {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {60437#true} call #t~ret158 := main(); {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {60437#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; {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L272 TraceCheckUtils]: 6: Hoare triple {60437#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {60437#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; {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {60437#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; {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {60437#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {60437#true} assume !false; {60437#true} is VALID [2022-04-07 16:11:49,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {60437#true} assume 12292 == #t~mem49;havoc #t~mem49; {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {60437#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; {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {60437#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {60437#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {60437#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {60437#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {60437#true} assume !(0 == ~tmp___4~0); {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {60437#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {60437#true} ~skip~0 := 0; {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {60437#true} assume !false; {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {60437#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {60437#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {60437#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {60437#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {60437#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {60437#true} assume 4368 == #t~mem54;havoc #t~mem54; {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {60437#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; {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {60437#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {60437#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; {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {60437#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {60437#true} ~skip~0 := 0; {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {60437#true} assume !false; {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {60437#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {60437#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {60437#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {60437#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {60437#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {60437#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {60437#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {60437#true} assume 4384 == #t~mem56;havoc #t~mem56; {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 50: Hoare triple {60437#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {60437#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {60437#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {60437#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {60437#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,954 INFO L290 TraceCheckUtils]: 55: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {60437#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 57: Hoare triple {60437#true} ~skip~0 := 0; {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {60437#true} assume !false; {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {60437#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {60437#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {60437#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {60437#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 64: Hoare triple {60437#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 65: Hoare triple {60437#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 66: Hoare triple {60437#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 67: Hoare triple {60437#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 68: Hoare triple {60437#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,955 INFO L290 TraceCheckUtils]: 69: Hoare triple {60437#true} assume 4400 == #t~mem58;havoc #t~mem58; {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 70: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 71: Hoare triple {60437#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; {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 72: Hoare triple {60437#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 73: Hoare triple {60437#true} assume !(~ret~0 <= 0); {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 74: Hoare triple {60437#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 75: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 76: Hoare triple {60437#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 77: Hoare triple {60437#true} ~skip~0 := 0; {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 78: Hoare triple {60437#true} assume !false; {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 79: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 80: Hoare triple {60437#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 81: Hoare triple {60437#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,956 INFO L290 TraceCheckUtils]: 82: Hoare triple {60437#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 83: Hoare triple {60437#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 84: Hoare triple {60437#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 85: Hoare triple {60437#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 86: Hoare triple {60437#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 87: Hoare triple {60437#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 88: Hoare triple {60437#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 89: Hoare triple {60437#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 90: Hoare triple {60437#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 91: Hoare triple {60437#true} assume 4416 == #t~mem60;havoc #t~mem60; {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 92: Hoare triple {60437#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 93: Hoare triple {60437#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 94: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 95: Hoare triple {60437#true} assume !(0 == ~tmp___6~0); {60437#true} is VALID [2022-04-07 16:11:49,957 INFO L290 TraceCheckUtils]: 96: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 97: Hoare triple {60437#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 98: Hoare triple {60437#true} ~skip~0 := 0; {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 99: Hoare triple {60437#true} assume !false; {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 100: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 101: Hoare triple {60437#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 102: Hoare triple {60437#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 103: Hoare triple {60437#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 104: Hoare triple {60437#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 105: Hoare triple {60437#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 106: Hoare triple {60437#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 107: Hoare triple {60437#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 108: Hoare triple {60437#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,958 INFO L290 TraceCheckUtils]: 109: Hoare triple {60437#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,959 INFO L290 TraceCheckUtils]: 110: Hoare triple {60437#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,959 INFO L290 TraceCheckUtils]: 111: Hoare triple {60437#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60442#(= |ssl3_connect_#t~mem60| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:11:49,959 INFO L290 TraceCheckUtils]: 112: Hoare triple {60442#(= |ssl3_connect_#t~mem60| (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); {60443#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,960 INFO L290 TraceCheckUtils]: 113: Hoare triple {60443#(not (= 4416 (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); {60444#(not (= |ssl3_connect_#t~mem62| 4416))} is VALID [2022-04-07 16:11:49,960 INFO L290 TraceCheckUtils]: 114: Hoare triple {60444#(not (= |ssl3_connect_#t~mem62| 4416))} assume 4432 == #t~mem62;havoc #t~mem62; {60437#true} is VALID [2022-04-07 16:11:49,960 INFO L290 TraceCheckUtils]: 115: Hoare triple {60437#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {60437#true} is VALID [2022-04-07 16:11:49,960 INFO L290 TraceCheckUtils]: 116: Hoare triple {60437#true} assume !(5 == ~blastFlag~0); {60437#true} is VALID [2022-04-07 16:11:49,960 INFO L290 TraceCheckUtils]: 117: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,960 INFO L290 TraceCheckUtils]: 118: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,960 INFO L290 TraceCheckUtils]: 119: Hoare triple {60437#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {60437#true} is VALID [2022-04-07 16:11:49,960 INFO L290 TraceCheckUtils]: 120: Hoare triple {60437#true} ~skip~0 := 0; {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 121: Hoare triple {60437#true} assume !false; {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 122: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 123: Hoare triple {60437#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 124: Hoare triple {60437#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 125: Hoare triple {60437#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 126: Hoare triple {60437#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 127: Hoare triple {60437#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 128: Hoare triple {60437#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 129: Hoare triple {60437#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 130: Hoare triple {60437#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 131: Hoare triple {60437#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 132: Hoare triple {60437#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 133: Hoare triple {60437#true} assume 4401 == #t~mem59;havoc #t~mem59; {60437#true} is VALID [2022-04-07 16:11:49,961 INFO L290 TraceCheckUtils]: 134: Hoare triple {60437#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); {60437#true} is VALID [2022-04-07 16:11:49,962 INFO L290 TraceCheckUtils]: 135: Hoare triple {60437#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; {60437#true} is VALID [2022-04-07 16:11:49,962 INFO L290 TraceCheckUtils]: 136: Hoare triple {60437#true} assume !(2 == ~blastFlag~0); {60437#true} is VALID [2022-04-07 16:11:49,962 INFO L290 TraceCheckUtils]: 137: Hoare triple {60437#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {60437#true} is VALID [2022-04-07 16:11:49,962 INFO L290 TraceCheckUtils]: 138: Hoare triple {60437#true} assume !(~ret~0 <= 0); {60437#true} is VALID [2022-04-07 16:11:49,963 INFO L290 TraceCheckUtils]: 139: Hoare triple {60437#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,963 INFO L290 TraceCheckUtils]: 140: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,964 INFO L290 TraceCheckUtils]: 141: Hoare triple {60445#(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; {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,964 INFO L290 TraceCheckUtils]: 142: Hoare triple {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,964 INFO L290 TraceCheckUtils]: 143: Hoare triple {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,964 INFO L290 TraceCheckUtils]: 144: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,965 INFO L290 TraceCheckUtils]: 145: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,965 INFO L290 TraceCheckUtils]: 146: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,965 INFO L290 TraceCheckUtils]: 147: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,966 INFO L290 TraceCheckUtils]: 148: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,966 INFO L290 TraceCheckUtils]: 149: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,966 INFO L290 TraceCheckUtils]: 150: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,967 INFO L290 TraceCheckUtils]: 151: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,967 INFO L290 TraceCheckUtils]: 152: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,967 INFO L290 TraceCheckUtils]: 153: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,967 INFO L290 TraceCheckUtils]: 154: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,968 INFO L290 TraceCheckUtils]: 155: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,968 INFO L290 TraceCheckUtils]: 156: Hoare triple {60445#(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); {60445#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:11:49,968 INFO L290 TraceCheckUtils]: 157: Hoare triple {60445#(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); {60446#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-07 16:11:49,969 INFO L290 TraceCheckUtils]: 158: Hoare triple {60446#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {60438#false} is VALID [2022-04-07 16:11:49,969 INFO L290 TraceCheckUtils]: 159: Hoare triple {60438#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {60438#false} is VALID [2022-04-07 16:11:49,969 INFO L290 TraceCheckUtils]: 160: Hoare triple {60438#false} assume 5 == ~blastFlag~0; {60438#false} is VALID [2022-04-07 16:11:49,969 INFO L290 TraceCheckUtils]: 161: Hoare triple {60438#false} assume !false; {60438#false} is VALID [2022-04-07 16:11:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 94 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-07 16:11:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731186099] [2022-04-07 16:11:49,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731186099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:11:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721638239] [2022-04-07 16:11:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:49,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:11:49,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:11:49,972 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:11:49,973 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:11:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:50,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 16:11:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:50,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:11:51,045 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-07 16:11:51,046 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:11:51,056 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:11:51,067 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:11:51,097 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:11:51,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-04-07 16:11:51,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3