/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:45:19,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:45:19,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:45:19,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:45:19,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:45:19,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:45:19,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:45:19,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:45:19,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:45:19,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:45:19,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:45:19,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:45:19,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:45:19,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:45:19,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:45:19,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:45:19,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:45:19,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:45:19,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:45:19,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:45:19,132 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:45:19,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:45:19,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:45:19,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:45:19,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:45:19,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:45:19,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:45:19,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:45:19,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:45:19,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:45:19,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:45:19,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:45:19,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:45:19,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:45:19,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:45:19,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:45:19,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:45:19,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:45:19,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:45:19,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:45:19,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:45:19,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:45:19,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:45:19,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:45:19,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:45:19,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:45:19,171 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:45:19,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:45:19,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:45:19,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:45:19,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:45:19,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:45:19,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:45:19,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:45:19,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:45:19,173 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:45:19,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:45:19,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:45:19,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:45:19,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:45:19,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:45:19,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:45:19,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:45:19,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:45:19,174 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:45:19,174 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:45:19,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:45:19,174 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:45:19,174 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:45:19,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:45:19,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:45:19,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:45:19,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:45:19,470 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:45:19,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c [2022-04-08 08:45:19,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78147a216/fa02b278635b460ba140780e12e14743/FLAGaa2919db1 [2022-04-08 08:45:20,134 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:45:20,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c [2022-04-08 08:45:20,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78147a216/fa02b278635b460ba140780e12e14743/FLAGaa2919db1 [2022-04-08 08:45:20,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78147a216/fa02b278635b460ba140780e12e14743 [2022-04-08 08:45:20,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:45:20,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:45:20,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:45:20,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:45:20,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:45:20,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:45:20" (1/1) ... [2022-04-08 08:45:20,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1010172d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:20, skipping insertion in model container [2022-04-08 08:45:20,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:45:20" (1/1) ... [2022-04-08 08:45:20,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:45:20,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:45:20,960 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_srvr.blast.15.i.cil-2.c[75833,75846] [2022-04-08 08:45:20,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:45:20,985 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:45:21,115 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_srvr.blast.15.i.cil-2.c[75833,75846] [2022-04-08 08:45:21,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:45:21,134 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:45:21,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21 WrapperNode [2022-04-08 08:45:21,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:45:21,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:45:21,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:45:21,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:45:21,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (1/1) ... [2022-04-08 08:45:21,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (1/1) ... [2022-04-08 08:45:21,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (1/1) ... [2022-04-08 08:45:21,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (1/1) ... [2022-04-08 08:45:21,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (1/1) ... [2022-04-08 08:45:21,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (1/1) ... [2022-04-08 08:45:21,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (1/1) ... [2022-04-08 08:45:21,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:45:21,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:45:21,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:45:21,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:45:21,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (1/1) ... [2022-04-08 08:45:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:45:21,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:45:21,336 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-08 08:45:21,364 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-08 08:45:21,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:45:21,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:45:21,379 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:45:21,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:45:21,379 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:45:21,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:45:21,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:45:21,380 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:45:21,380 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:45:21,380 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:45:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:45:21,382 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:45:21,383 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:45:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:45:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:45:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:45:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:45:21,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:45:21,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:45:21,385 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:45:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:45:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:45:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:45:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:45:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:45:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:45:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:45:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:45:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:45:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:45:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:45:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:45:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:45:21,573 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:45:21,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:45:22,561 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:45:23,166 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:45:23,166 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:45:23,178 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:45:23,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:45:23,186 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:45:23,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:45:23 BoogieIcfgContainer [2022-04-08 08:45:23,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:45:23,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:45:23,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:45:23,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:45:23,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:45:20" (1/3) ... [2022-04-08 08:45:23,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415117c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:45:23, skipping insertion in model container [2022-04-08 08:45:23,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:21" (2/3) ... [2022-04-08 08:45:23,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415117c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:45:23, skipping insertion in model container [2022-04-08 08:45:23,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:45:23" (3/3) ... [2022-04-08 08:45:23,195 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2022-04-08 08:45:23,200 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:45:23,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:45:23,235 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:45:23,241 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:45:23,241 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:45:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 155 states have internal predecessors, (264), 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-08 08:45:23,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 08:45:23,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:23,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:23,277 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:23,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash -668377608, now seen corresponding path program 1 times [2022-04-08 08:45:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:23,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1171295604] [2022-04-08 08:45:23,301 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:45:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash -668377608, now seen corresponding path program 2 times [2022-04-08 08:45:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:23,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423592445] [2022-04-08 08:45:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:23,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165#true} is VALID [2022-04-08 08:45:23,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-08 08:45:23,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #708#return; {165#true} is VALID [2022-04-08 08:45:23,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:23,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165#true} is VALID [2022-04-08 08:45:23,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-08 08:45:23,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #708#return; {165#true} is VALID [2022-04-08 08:45:23,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret161 := main(); {165#true} is VALID [2022-04-08 08:45:23,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {165#true} is VALID [2022-04-08 08:45:23,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {165#true} is VALID [2022-04-08 08:45:23,895 INFO L272 TraceCheckUtils]: 7: Hoare triple {165#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {165#true} is VALID [2022-04-08 08:45:23,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {171#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:45:23,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {171#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {166#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {166#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {166#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {166#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {166#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {166#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {166#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {166#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {166#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {166#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {166#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-08 08:45:23,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {166#false} assume 8640 == #t~mem75;havoc #t~mem75; {166#false} is VALID [2022-04-08 08:45:23,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {166#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {166#false} is VALID [2022-04-08 08:45:23,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {166#false} assume !(4 == ~blastFlag~0); {166#false} is VALID [2022-04-08 08:45:23,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {166#false} assume !(7 == ~blastFlag~0); {166#false} is VALID [2022-04-08 08:45:23,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {166#false} assume !(10 == ~blastFlag~0); {166#false} is VALID [2022-04-08 08:45:23,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {166#false} assume 13 == ~blastFlag~0; {166#false} is VALID [2022-04-08 08:45:23,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-08 08:45:23,937 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-08 08:45:23,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:23,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423592445] [2022-04-08 08:45:23,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423592445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:23,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:23,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:23,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:23,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1171295604] [2022-04-08 08:45:23,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1171295604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:23,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:23,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744017295] [2022-04-08 08:45:23,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 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 51 [2022-04-08 08:45:23,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:23,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:24,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:24,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:24,059 INFO L87 Difference]: Start difference. First operand has 162 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 155 states have internal predecessors, (264), 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 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:28,807 INFO L93 Difference]: Finished difference Result 342 states and 576 transitions. [2022-04-08 08:45:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:28,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 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 51 [2022-04-08 08:45:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:45:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:45:28,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-08 08:45:29,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:29,333 INFO L225 Difference]: With dead ends: 342 [2022-04-08 08:45:29,333 INFO L226 Difference]: Without dead ends: 174 [2022-04-08 08:45:29,336 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-08 08:45:29,340 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 34 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:29,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 631 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 08:45:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-08 08:45:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2022-04-08 08:45:29,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:29,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,380 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,381 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:29,389 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2022-04-08 08:45:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2022-04-08 08:45:29,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:29,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:29,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 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 174 states. [2022-04-08 08:45:29,392 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 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 174 states. [2022-04-08 08:45:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:29,399 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2022-04-08 08:45:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2022-04-08 08:45:29,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:29,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:29,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:29,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2022-04-08 08:45:29,409 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 51 [2022-04-08 08:45:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:29,409 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2022-04-08 08:45:29,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 242 transitions. [2022-04-08 08:45:29,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2022-04-08 08:45:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:29,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:29,598 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:29,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:45:29,599 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:29,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash -480939749, now seen corresponding path program 1 times [2022-04-08 08:45:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:29,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1460366984] [2022-04-08 08:45:29,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:29,653 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:29,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash -480939749, now seen corresponding path program 2 times [2022-04-08 08:45:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:29,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873639927] [2022-04-08 08:45:29,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:29,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:29,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1523#true} is VALID [2022-04-08 08:45:29,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-08 08:45:29,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1523#true} {1523#true} #708#return; {1523#true} is VALID [2022-04-08 08:45:29,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:29,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1523#true} is VALID [2022-04-08 08:45:29,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-08 08:45:29,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #708#return; {1523#true} is VALID [2022-04-08 08:45:29,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret161 := main(); {1523#true} is VALID [2022-04-08 08:45:29,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1523#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1523#true} is VALID [2022-04-08 08:45:29,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1523#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1523#true} is VALID [2022-04-08 08:45:29,868 INFO L272 TraceCheckUtils]: 7: Hoare triple {1523#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1523#true} is VALID [2022-04-08 08:45:29,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:29,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1529#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 08:45:29,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {1524#false} is VALID [2022-04-08 08:45:29,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {1524#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {1524#false} is VALID [2022-04-08 08:45:29,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {1524#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {1524#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {1524#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1524#false} is VALID [2022-04-08 08:45:29,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {1524#false} ~skip~0 := 0; {1524#false} is VALID [2022-04-08 08:45:29,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-08 08:45:29,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {1524#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {1524#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {1524#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {1524#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {1524#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {1524#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {1524#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {1524#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {1524#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {1524#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {1524#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {1524#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {1524#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {1524#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {1524#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {1524#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {1524#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {1524#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {1524#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {1524#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {1524#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {1524#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {1524#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {1524#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {1524#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {1524#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,884 INFO L290 TraceCheckUtils]: 54: Hoare triple {1524#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,884 INFO L290 TraceCheckUtils]: 55: Hoare triple {1524#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,884 INFO L290 TraceCheckUtils]: 56: Hoare triple {1524#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-08 08:45:29,884 INFO L290 TraceCheckUtils]: 57: Hoare triple {1524#false} assume 8640 == #t~mem75;havoc #t~mem75; {1524#false} is VALID [2022-04-08 08:45:29,884 INFO L290 TraceCheckUtils]: 58: Hoare triple {1524#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1524#false} is VALID [2022-04-08 08:45:29,885 INFO L290 TraceCheckUtils]: 59: Hoare triple {1524#false} assume !(4 == ~blastFlag~0); {1524#false} is VALID [2022-04-08 08:45:29,885 INFO L290 TraceCheckUtils]: 60: Hoare triple {1524#false} assume !(7 == ~blastFlag~0); {1524#false} is VALID [2022-04-08 08:45:29,885 INFO L290 TraceCheckUtils]: 61: Hoare triple {1524#false} assume !(10 == ~blastFlag~0); {1524#false} is VALID [2022-04-08 08:45:29,885 INFO L290 TraceCheckUtils]: 62: Hoare triple {1524#false} assume 13 == ~blastFlag~0; {1524#false} is VALID [2022-04-08 08:45:29,885 INFO L290 TraceCheckUtils]: 63: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-08 08:45:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:29,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873639927] [2022-04-08 08:45:29,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873639927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:29,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:29,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:29,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:29,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1460366984] [2022-04-08 08:45:29,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1460366984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:29,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:29,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:29,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248256846] [2022-04-08 08:45:29,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:29,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:45:29,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:29,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:29,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:29,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:29,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:29,957 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:32,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:36,231 INFO L93 Difference]: Finished difference Result 408 states and 634 transitions. [2022-04-08 08:45:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:36,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:45:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-08 08:45:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-08 08:45:36,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-08 08:45:36,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:36,744 INFO L225 Difference]: With dead ends: 408 [2022-04-08 08:45:36,744 INFO L226 Difference]: Without dead ends: 277 [2022-04-08 08:45:36,745 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-08 08:45:36,746 INFO L913 BasicCegarLoop]: 273 mSDtfsCounter, 149 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:36,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 662 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 08:45:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-08 08:45:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 173. [2022-04-08 08:45:36,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:36,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:36,762 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:36,762 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:36,780 INFO L93 Difference]: Finished difference Result 277 states and 428 transitions. [2022-04-08 08:45:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 428 transitions. [2022-04-08 08:45:36,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:36,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:36,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 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 277 states. [2022-04-08 08:45:36,782 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 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 277 states. [2022-04-08 08:45:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:36,799 INFO L93 Difference]: Finished difference Result 277 states and 428 transitions. [2022-04-08 08:45:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 428 transitions. [2022-04-08 08:45:36,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:36,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:36,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:36,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 267 transitions. [2022-04-08 08:45:36,810 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 267 transitions. Word has length 64 [2022-04-08 08:45:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:36,812 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 267 transitions. [2022-04-08 08:45:36,812 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:36,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 267 transitions. [2022-04-08 08:45:37,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 267 transitions. [2022-04-08 08:45:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:45:37,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:37,038 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:37,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:45:37,039 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1522986347, now seen corresponding path program 1 times [2022-04-08 08:45:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:37,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833932515] [2022-04-08 08:45:37,070 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:37,070 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:37,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:37,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1522986347, now seen corresponding path program 2 times [2022-04-08 08:45:37,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:37,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003026634] [2022-04-08 08:45:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:37,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:37,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3251#true} is VALID [2022-04-08 08:45:37,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {3251#true} assume true; {3251#true} is VALID [2022-04-08 08:45:37,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3251#true} {3251#true} #708#return; {3251#true} is VALID [2022-04-08 08:45:37,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {3251#true} call ULTIMATE.init(); {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:37,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3251#true} is VALID [2022-04-08 08:45:37,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#true} assume true; {3251#true} is VALID [2022-04-08 08:45:37,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3251#true} {3251#true} #708#return; {3251#true} is VALID [2022-04-08 08:45:37,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {3251#true} call #t~ret161 := main(); {3251#true} is VALID [2022-04-08 08:45:37,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3251#true} is VALID [2022-04-08 08:45:37,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {3251#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3251#true} is VALID [2022-04-08 08:45:37,229 INFO L272 TraceCheckUtils]: 7: Hoare triple {3251#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3251#true} is VALID [2022-04-08 08:45:37,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {3251#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:37,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:37,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:37,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:37,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:37,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:37,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:37,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3257#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:45:37,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {3257#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {3252#false} is VALID [2022-04-08 08:45:37,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {3252#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {3252#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {3252#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3252#false} is VALID [2022-04-08 08:45:37,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {3252#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {3252#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {3252#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {3252#false} is VALID [2022-04-08 08:45:37,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {3252#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {3252#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {3252#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {3252#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3252#false} is VALID [2022-04-08 08:45:37,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {3252#false} ~skip~0 := 0; {3252#false} is VALID [2022-04-08 08:45:37,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2022-04-08 08:45:37,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {3252#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {3252#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {3252#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {3252#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {3252#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {3252#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {3252#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {3252#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {3252#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {3252#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {3252#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {3252#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {3252#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {3252#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {3252#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {3252#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {3252#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {3252#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {3252#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {3252#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {3252#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {3252#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {3252#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {3252#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {3252#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {3252#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,262 INFO L290 TraceCheckUtils]: 55: Hoare triple {3252#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {3252#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {3252#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-08 08:45:37,262 INFO L290 TraceCheckUtils]: 58: Hoare triple {3252#false} assume 8640 == #t~mem75;havoc #t~mem75; {3252#false} is VALID [2022-04-08 08:45:37,262 INFO L290 TraceCheckUtils]: 59: Hoare triple {3252#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3252#false} is VALID [2022-04-08 08:45:37,263 INFO L290 TraceCheckUtils]: 60: Hoare triple {3252#false} assume !(4 == ~blastFlag~0); {3252#false} is VALID [2022-04-08 08:45:37,263 INFO L290 TraceCheckUtils]: 61: Hoare triple {3252#false} assume !(7 == ~blastFlag~0); {3252#false} is VALID [2022-04-08 08:45:37,263 INFO L290 TraceCheckUtils]: 62: Hoare triple {3252#false} assume !(10 == ~blastFlag~0); {3252#false} is VALID [2022-04-08 08:45:37,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {3252#false} assume 13 == ~blastFlag~0; {3252#false} is VALID [2022-04-08 08:45:37,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2022-04-08 08:45:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:37,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:37,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003026634] [2022-04-08 08:45:37,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003026634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:37,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:37,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:37,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:37,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833932515] [2022-04-08 08:45:37,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833932515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:37,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:37,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43339792] [2022-04-08 08:45:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:37,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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 65 [2022-04-08 08:45:37,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:37,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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-08 08:45:37,317 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-08 08:45:37,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:37,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:37,318 INFO L87 Difference]: Start difference. First operand 173 states and 267 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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-08 08:45:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:40,969 INFO L93 Difference]: Finished difference Result 336 states and 517 transitions. [2022-04-08 08:45:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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 65 [2022-04-08 08:45:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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-08 08:45:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-08 08:45:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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-08 08:45:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-08 08:45:40,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-08 08:45:41,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:41,303 INFO L225 Difference]: With dead ends: 336 [2022-04-08 08:45:41,303 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 08:45:41,304 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-08 08:45:41,305 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 28 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:41,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 509 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 08:45:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 08:45:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2022-04-08 08:45:41,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:41,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:41,325 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:41,326 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:41,331 INFO L93 Difference]: Finished difference Result 189 states and 286 transitions. [2022-04-08 08:45:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2022-04-08 08:45:41,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:41,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:41,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 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 189 states. [2022-04-08 08:45:41,333 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 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 189 states. [2022-04-08 08:45:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:41,339 INFO L93 Difference]: Finished difference Result 189 states and 286 transitions. [2022-04-08 08:45:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2022-04-08 08:45:41,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:41,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:41,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:41,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2022-04-08 08:45:41,345 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 65 [2022-04-08 08:45:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:41,346 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2022-04-08 08:45:41,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 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-08 08:45:41,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 266 transitions. [2022-04-08 08:45:41,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2022-04-08 08:45:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:45:41,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:41,554 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:41,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:45:41,555 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash -112549033, now seen corresponding path program 1 times [2022-04-08 08:45:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:41,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913287026] [2022-04-08 08:45:41,728 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:45:41,729 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:45:41,730 INFO L85 PathProgramCache]: Analyzing trace with hash 14964021, now seen corresponding path program 1 times [2022-04-08 08:45:41,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:41,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372254578] [2022-04-08 08:45:41,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:41,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:41,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:41,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4659#true} is VALID [2022-04-08 08:45:41,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {4659#true} assume true; {4659#true} is VALID [2022-04-08 08:45:41,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4659#true} {4659#true} #708#return; {4659#true} is VALID [2022-04-08 08:45:41,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {4659#true} call ULTIMATE.init(); {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:41,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4659#true} is VALID [2022-04-08 08:45:41,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {4659#true} assume true; {4659#true} is VALID [2022-04-08 08:45:41,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4659#true} {4659#true} #708#return; {4659#true} is VALID [2022-04-08 08:45:41,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {4659#true} call #t~ret161 := main(); {4659#true} is VALID [2022-04-08 08:45:41,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {4659#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {4659#true} is VALID [2022-04-08 08:45:41,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {4659#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4659#true} is VALID [2022-04-08 08:45:41,881 INFO L272 TraceCheckUtils]: 7: Hoare triple {4659#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4659#true} is VALID [2022-04-08 08:45:41,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {4659#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {4664#(= ssl3_accept_~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)))); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} [714] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_250|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_251|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} [713] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,895 INFO L290 TraceCheckUtils]: 46: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:41,896 INFO L290 TraceCheckUtils]: 50: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {4660#false} is VALID [2022-04-08 08:45:41,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {4660#false} assume !false; {4660#false} is VALID [2022-04-08 08:45:41,897 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-08 08:45:41,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:41,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372254578] [2022-04-08 08:45:41,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372254578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:41,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:41,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:45:45,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:45,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913287026] [2022-04-08 08:45:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913287026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:45,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:45,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:45:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025982533] [2022-04-08 08:45:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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 65 [2022-04-08 08:45:45,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:45,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:45:45,238 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-08 08:45:45,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:45:45,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:45,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:45:45,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:45:45,240 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:45:47,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:49,015 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-08 08:45:51,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:59,543 INFO L93 Difference]: Finished difference Result 465 states and 726 transitions. [2022-04-08 08:45:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:45:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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 65 [2022-04-08 08:45:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:45:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 631 transitions. [2022-04-08 08:45:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:45:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 631 transitions. [2022-04-08 08:45:59,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 631 transitions. [2022-04-08 08:46:00,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:00,078 INFO L225 Difference]: With dead ends: 465 [2022-04-08 08:46:00,078 INFO L226 Difference]: Without dead ends: 318 [2022-04-08 08:46:00,079 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:46:00,080 INFO L913 BasicCegarLoop]: 348 mSDtfsCounter, 148 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:00,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 992 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1061 Invalid, 1 Unknown, 14 Unchecked, 7.9s Time] [2022-04-08 08:46:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-04-08 08:46:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313. [2022-04-08 08:46:00,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:00,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:00,118 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:00,119 INFO L87 Difference]: Start difference. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:00,131 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-08 08:46:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 481 transitions. [2022-04-08 08:46:00,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:00,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:00,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 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 318 states. [2022-04-08 08:46:00,151 INFO L87 Difference]: Start difference. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 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 318 states. [2022-04-08 08:46:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:00,159 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-08 08:46:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 481 transitions. [2022-04-08 08:46:00,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:00,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:00,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:00,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 475 transitions. [2022-04-08 08:46:00,171 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 475 transitions. Word has length 65 [2022-04-08 08:46:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:00,172 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 475 transitions. [2022-04-08 08:46:00,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:46:00,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 475 transitions. [2022-04-08 08:46:00,561 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-08 08:46:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-04-08 08:46:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:46:00,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:00,563 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:00,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:46:00,563 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1815723669, now seen corresponding path program 1 times [2022-04-08 08:46:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:00,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227612631] [2022-04-08 08:46:00,732 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:00,732 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash -354863755, now seen corresponding path program 1 times [2022-04-08 08:46:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:00,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663184951] [2022-04-08 08:46:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:00,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6869#true} is VALID [2022-04-08 08:46:00,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-08 08:46:00,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6869#true} {6869#true} #708#return; {6869#true} is VALID [2022-04-08 08:46:00,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {6869#true} call ULTIMATE.init(); {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:00,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6869#true} is VALID [2022-04-08 08:46:00,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-08 08:46:00,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6869#true} {6869#true} #708#return; {6869#true} is VALID [2022-04-08 08:46:00,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {6869#true} call #t~ret161 := main(); {6869#true} is VALID [2022-04-08 08:46:00,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {6869#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6869#true} is VALID [2022-04-08 08:46:00,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {6869#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6869#true} is VALID [2022-04-08 08:46:00,921 INFO L272 TraceCheckUtils]: 7: Hoare triple {6869#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6869#true} is VALID [2022-04-08 08:46:00,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {6869#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {6874#(= ssl3_accept_~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)))); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} [716] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_269|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_14|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_14|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_15|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_13|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_8|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_14|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_14|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_13|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_16|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_9|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_19, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_8|, #memory_int=|v_#memory_int_269|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_269|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_11} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} [715] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:00,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {6870#false} is VALID [2022-04-08 08:46:00,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {6870#false} assume !false; {6870#false} is VALID [2022-04-08 08:46:00,942 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-08 08:46:00,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:00,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663184951] [2022-04-08 08:46:00,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663184951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:00,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:00,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:46:04,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:04,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227612631] [2022-04-08 08:46:04,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227612631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:04,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:04,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:46:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091105443] [2022-04-08 08:46:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:04,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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 65 [2022-04-08 08:46:04,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:04,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:46:04,652 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-08 08:46:04,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:46:04,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:04,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:46:04,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:46:04,654 INFO L87 Difference]: Start difference. First operand 313 states and 475 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:46:06,699 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-08 08:46:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:08,911 INFO L93 Difference]: Finished difference Result 469 states and 717 transitions. [2022-04-08 08:46:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:46:08,912 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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 65 [2022-04-08 08:46:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:46:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 617 transitions. [2022-04-08 08:46:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:46:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 617 transitions. [2022-04-08 08:46:08,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 617 transitions. [2022-04-08 08:46:09,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:09,348 INFO L225 Difference]: With dead ends: 469 [2022-04-08 08:46:09,349 INFO L226 Difference]: Without dead ends: 322 [2022-04-08 08:46:09,349 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:46:09,350 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 146 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:09,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 926 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 626 Invalid, 1 Unknown, 460 Unchecked, 2.7s Time] [2022-04-08 08:46:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-08 08:46:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 313. [2022-04-08 08:46:09,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:09,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,369 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,370 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:09,377 INFO L93 Difference]: Finished difference Result 322 states and 486 transitions. [2022-04-08 08:46:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 486 transitions. [2022-04-08 08:46:09,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:09,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:09,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 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 322 states. [2022-04-08 08:46:09,380 INFO L87 Difference]: Start difference. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 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 322 states. [2022-04-08 08:46:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:09,388 INFO L93 Difference]: Finished difference Result 322 states and 486 transitions. [2022-04-08 08:46:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 486 transitions. [2022-04-08 08:46:09,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:09,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:09,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:09,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 475 transitions. [2022-04-08 08:46:09,398 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 475 transitions. Word has length 65 [2022-04-08 08:46:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:09,398 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 475 transitions. [2022-04-08 08:46:09,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-08 08:46:09,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 475 transitions. [2022-04-08 08:46:09,782 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-08 08:46:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-04-08 08:46:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:46:09,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:09,783 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:09,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:46:09,783 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1939266114, now seen corresponding path program 1 times [2022-04-08 08:46:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:09,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742873548] [2022-04-08 08:46:09,805 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:09,805 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:09,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1939266114, now seen corresponding path program 2 times [2022-04-08 08:46:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:09,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556799485] [2022-04-08 08:46:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:09,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9095#true} is VALID [2022-04-08 08:46:09,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {9095#true} assume true; {9095#true} is VALID [2022-04-08 08:46:09,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9095#true} {9095#true} #708#return; {9095#true} is VALID [2022-04-08 08:46:09,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {9095#true} call ULTIMATE.init(); {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:09,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9095#true} is VALID [2022-04-08 08:46:09,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {9095#true} assume true; {9095#true} is VALID [2022-04-08 08:46:09,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9095#true} {9095#true} #708#return; {9095#true} is VALID [2022-04-08 08:46:09,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {9095#true} call #t~ret161 := main(); {9095#true} is VALID [2022-04-08 08:46:09,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {9095#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9095#true} is VALID [2022-04-08 08:46:09,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {9095#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9095#true} is VALID [2022-04-08 08:46:09,947 INFO L272 TraceCheckUtils]: 7: Hoare triple {9095#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9095#true} is VALID [2022-04-08 08:46:09,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {9095#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:09,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:09,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:09,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:09,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:09,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:09,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:09,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:09,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9101#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 08:46:09,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {9101#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {9096#false} is VALID [2022-04-08 08:46:09,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {9096#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {9096#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9096#false} is VALID [2022-04-08 08:46:09,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {9096#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {9096#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {9096#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {9096#false} is VALID [2022-04-08 08:46:09,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {9096#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {9096#false} assume 12292 != #t~mem85;havoc #t~mem85; {9096#false} is VALID [2022-04-08 08:46:09,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {9096#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {9096#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {9096#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {9096#false} ~skip~0 := 0; {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {9096#false} assume !false; {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {9096#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {9096#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {9096#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {9096#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {9096#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {9096#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {9096#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {9096#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {9096#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {9096#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {9096#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {9096#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {9096#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {9096#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {9096#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {9096#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {9096#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {9096#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {9096#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,958 INFO L290 TraceCheckUtils]: 49: Hoare triple {9096#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,958 INFO L290 TraceCheckUtils]: 50: Hoare triple {9096#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,958 INFO L290 TraceCheckUtils]: 51: Hoare triple {9096#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {9096#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {9096#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 54: Hoare triple {9096#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 55: Hoare triple {9096#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {9096#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {9096#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {9096#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {9096#false} assume 8640 == #t~mem75;havoc #t~mem75; {9096#false} is VALID [2022-04-08 08:46:09,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {9096#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9096#false} is VALID [2022-04-08 08:46:09,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {9096#false} assume !(4 == ~blastFlag~0); {9096#false} is VALID [2022-04-08 08:46:09,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {9096#false} assume !(7 == ~blastFlag~0); {9096#false} is VALID [2022-04-08 08:46:09,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {9096#false} assume !(10 == ~blastFlag~0); {9096#false} is VALID [2022-04-08 08:46:09,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {9096#false} assume 13 == ~blastFlag~0; {9096#false} is VALID [2022-04-08 08:46:09,960 INFO L290 TraceCheckUtils]: 65: Hoare triple {9096#false} assume !false; {9096#false} is VALID [2022-04-08 08:46:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:09,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:09,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556799485] [2022-04-08 08:46:09,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556799485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:09,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:09,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:09,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:09,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742873548] [2022-04-08 08:46:09,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742873548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:09,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:09,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896944526] [2022-04-08 08:46:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:09,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:09,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:10,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:10,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:10,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:10,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:10,023 INFO L87 Difference]: Start difference. First operand 313 states and 475 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:14,228 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-08 08:46:16,249 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-08 08:46:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:18,067 INFO L93 Difference]: Finished difference Result 677 states and 1037 transitions. [2022-04-08 08:46:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-08 08:46:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-08 08:46:18,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-08 08:46:18,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:18,591 INFO L225 Difference]: With dead ends: 677 [2022-04-08 08:46:18,591 INFO L226 Difference]: Without dead ends: 523 [2022-04-08 08:46:18,592 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-08 08:46:18,593 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 153 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:18,593 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 366 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 483 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-04-08 08:46:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-08 08:46:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 325. [2022-04-08 08:46:18,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:18,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:18,612 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:18,613 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:18,629 INFO L93 Difference]: Finished difference Result 523 states and 794 transitions. [2022-04-08 08:46:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-08 08:46:18,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:18,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:18,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 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 523 states. [2022-04-08 08:46:18,632 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 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 523 states. [2022-04-08 08:46:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:18,647 INFO L93 Difference]: Finished difference Result 523 states and 794 transitions. [2022-04-08 08:46:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-08 08:46:18,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:18,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:18,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:18,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 490 transitions. [2022-04-08 08:46:18,659 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 490 transitions. Word has length 66 [2022-04-08 08:46:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:18,659 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 490 transitions. [2022-04-08 08:46:18,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:18,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 490 transitions. [2022-04-08 08:46:19,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 490 transitions. [2022-04-08 08:46:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:46:19,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:19,175 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:19,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:46:19,175 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1596653458, now seen corresponding path program 1 times [2022-04-08 08:46:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:19,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [112661423] [2022-04-08 08:46:19,327 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:19,328 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -724691531, now seen corresponding path program 1 times [2022-04-08 08:46:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:19,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837980575] [2022-04-08 08:46:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:19,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:19,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12157#true} is VALID [2022-04-08 08:46:19,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {12157#true} assume true; {12157#true} is VALID [2022-04-08 08:46:19,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12157#true} {12157#true} #708#return; {12157#true} is VALID [2022-04-08 08:46:19,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {12157#true} call ULTIMATE.init(); {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:19,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12157#true} is VALID [2022-04-08 08:46:19,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {12157#true} assume true; {12157#true} is VALID [2022-04-08 08:46:19,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12157#true} {12157#true} #708#return; {12157#true} is VALID [2022-04-08 08:46:19,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {12157#true} call #t~ret161 := main(); {12157#true} is VALID [2022-04-08 08:46:19,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {12157#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12157#true} is VALID [2022-04-08 08:46:19,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {12157#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12157#true} is VALID [2022-04-08 08:46:19,453 INFO L272 TraceCheckUtils]: 7: Hoare triple {12157#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12157#true} is VALID [2022-04-08 08:46:19,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {12157#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {12162#(= ssl3_accept_~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)))); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} [718] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_22|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_309|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_22|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_22|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_22|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_20|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_12|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_22|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_22|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_20|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_24|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_14|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_24, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_12|, #memory_int=|v_#memory_int_298|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_12|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_309|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_16} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} [717] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:19,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {12158#false} is VALID [2022-04-08 08:46:19,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {12158#false} assume !false; {12158#false} is VALID [2022-04-08 08:46:19,469 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-08 08:46:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:19,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837980575] [2022-04-08 08:46:19,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837980575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:19,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:19,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:46:22,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:22,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [112661423] [2022-04-08 08:46:22,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [112661423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:22,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:22,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:46:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674562235] [2022-04-08 08:46:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:22,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:22,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:22,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:22,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:46:22,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:46:22,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:46:22,439 INFO L87 Difference]: Start difference. First operand 325 states and 490 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,508 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-08 08:46:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:27,258 INFO L93 Difference]: Finished difference Result 495 states and 752 transitions. [2022-04-08 08:46:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:46:27,258 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 616 transitions. [2022-04-08 08:46:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 616 transitions. [2022-04-08 08:46:27,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 616 transitions. [2022-04-08 08:46:27,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:27,693 INFO L225 Difference]: With dead ends: 495 [2022-04-08 08:46:27,693 INFO L226 Difference]: Without dead ends: 336 [2022-04-08 08:46:27,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:46:27,694 INFO L913 BasicCegarLoop]: 204 mSDtfsCounter, 146 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:27,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 1224 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 654 Invalid, 1 Unknown, 698 Unchecked, 2.8s Time] [2022-04-08 08:46:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-08 08:46:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 327. [2022-04-08 08:46:27,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:27,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,713 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,714 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:27,722 INFO L93 Difference]: Finished difference Result 336 states and 504 transitions. [2022-04-08 08:46:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 504 transitions. [2022-04-08 08:46:27,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:27,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:27,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 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 336 states. [2022-04-08 08:46:27,724 INFO L87 Difference]: Start difference. First operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 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 336 states. [2022-04-08 08:46:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:27,732 INFO L93 Difference]: Finished difference Result 336 states and 504 transitions. [2022-04-08 08:46:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 504 transitions. [2022-04-08 08:46:27,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:27,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:27,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:27,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 493 transitions. [2022-04-08 08:46:27,742 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 493 transitions. Word has length 66 [2022-04-08 08:46:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:27,743 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 493 transitions. [2022-04-08 08:46:27,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 493 transitions. [2022-04-08 08:46:28,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 493 transitions. [2022-04-08 08:46:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:46:28,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:28,544 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:28,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:46:28,544 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash -770041136, now seen corresponding path program 1 times [2022-04-08 08:46:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:28,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801640070] [2022-04-08 08:46:28,745 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:28,745 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1094519307, now seen corresponding path program 1 times [2022-04-08 08:46:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:28,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274111136] [2022-04-08 08:46:28,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:28,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:28,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14492#true} is VALID [2022-04-08 08:46:28,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {14492#true} assume true; {14492#true} is VALID [2022-04-08 08:46:28,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14492#true} {14492#true} #708#return; {14492#true} is VALID [2022-04-08 08:46:28,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {14492#true} call ULTIMATE.init(); {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:28,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14492#true} is VALID [2022-04-08 08:46:28,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {14492#true} assume true; {14492#true} is VALID [2022-04-08 08:46:28,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14492#true} {14492#true} #708#return; {14492#true} is VALID [2022-04-08 08:46:28,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {14492#true} call #t~ret161 := main(); {14492#true} is VALID [2022-04-08 08:46:28,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {14492#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14492#true} is VALID [2022-04-08 08:46:28,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {14492#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14492#true} is VALID [2022-04-08 08:46:28,863 INFO L272 TraceCheckUtils]: 7: Hoare triple {14492#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14492#true} is VALID [2022-04-08 08:46:28,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {14492#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {14497#(= ssl3_accept_~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)))); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} [720] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_28|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_328|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_28|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_28|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_27|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_25|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_16|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_28|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_14|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_28|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_25|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_30|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_18|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_28, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_16|, #memory_int=|v_#memory_int_316|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_16|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_328|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_20} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} [719] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:28,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {14493#false} is VALID [2022-04-08 08:46:28,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {14493#false} assume !false; {14493#false} is VALID [2022-04-08 08:46:28,878 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-08 08:46:28,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:28,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274111136] [2022-04-08 08:46:28,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274111136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:28,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:28,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:46:32,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:32,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801640070] [2022-04-08 08:46:32,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801640070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:32,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:32,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:46:32,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422499873] [2022-04-08 08:46:32,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:32,160 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:32,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:32,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:32,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:32,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:46:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:32,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:46:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:46:32,226 INFO L87 Difference]: Start difference. First operand 327 states and 493 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:35,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:40,080 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-08 08:46:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:46,336 INFO L93 Difference]: Finished difference Result 496 states and 753 transitions. [2022-04-08 08:46:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:46:46,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 617 transitions. [2022-04-08 08:46:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 617 transitions. [2022-04-08 08:46:46,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 617 transitions. [2022-04-08 08:46:46,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:46,763 INFO L225 Difference]: With dead ends: 496 [2022-04-08 08:46:46,763 INFO L226 Difference]: Without dead ends: 337 [2022-04-08 08:46:46,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:46:46,764 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 145 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:46,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 918 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 775 Invalid, 1 Unknown, 310 Unchecked, 6.2s Time] [2022-04-08 08:46:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-08 08:46:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-08 08:46:46,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:46,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,781 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,782 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:46,790 INFO L93 Difference]: Finished difference Result 337 states and 505 transitions. [2022-04-08 08:46:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 505 transitions. [2022-04-08 08:46:46,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:46,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:46,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 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 337 states. [2022-04-08 08:46:46,792 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 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 337 states. [2022-04-08 08:46:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:46,800 INFO L93 Difference]: Finished difference Result 337 states and 505 transitions. [2022-04-08 08:46:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 505 transitions. [2022-04-08 08:46:46,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:46,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:46,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:46,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 490 transitions. [2022-04-08 08:46:46,810 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 490 transitions. Word has length 66 [2022-04-08 08:46:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:46,810 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 490 transitions. [2022-04-08 08:46:46,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 490 transitions. [2022-04-08 08:46:48,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 490 transitions. [2022-04-08 08:46:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:46:48,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:48,307 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:48,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:46:48,307 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash -493596445, now seen corresponding path program 1 times [2022-04-08 08:46:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:48,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94449528] [2022-04-08 08:46:48,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:48,339 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:48,339 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash -493596445, now seen corresponding path program 2 times [2022-04-08 08:46:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:48,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161883041] [2022-04-08 08:46:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:48,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:48,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16827#true} is VALID [2022-04-08 08:46:48,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {16827#true} assume true; {16827#true} is VALID [2022-04-08 08:46:48,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16827#true} {16827#true} #708#return; {16827#true} is VALID [2022-04-08 08:46:48,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {16827#true} call ULTIMATE.init(); {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:48,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16827#true} is VALID [2022-04-08 08:46:48,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {16827#true} assume true; {16827#true} is VALID [2022-04-08 08:46:48,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16827#true} {16827#true} #708#return; {16827#true} is VALID [2022-04-08 08:46:48,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {16827#true} call #t~ret161 := main(); {16827#true} is VALID [2022-04-08 08:46:48,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {16827#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16827#true} is VALID [2022-04-08 08:46:48,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {16827#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16827#true} is VALID [2022-04-08 08:46:48,538 INFO L272 TraceCheckUtils]: 7: Hoare triple {16827#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16827#true} is VALID [2022-04-08 08:46:48,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {16827#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:48,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16833#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-08 08:46:48,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {16833#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {16828#false} is VALID [2022-04-08 08:46:48,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {16828#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {16828#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16828#false} is VALID [2022-04-08 08:46:48,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {16828#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {16828#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {16828#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {16828#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {16828#false} assume 12292 != #t~mem85;havoc #t~mem85; {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {16828#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {16828#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {16828#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {16828#false} ~skip~0 := 0; {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {16828#false} assume !false; {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {16828#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {16828#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {16828#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {16828#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {16828#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {16828#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {16828#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {16828#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {16828#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {16828#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {16828#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {16828#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {16828#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {16828#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {16828#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {16828#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {16828#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {16828#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {16828#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {16828#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {16828#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {16828#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {16828#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {16828#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 55: Hoare triple {16828#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {16828#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {16828#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {16828#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 59: Hoare triple {16828#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 60: Hoare triple {16828#false} assume 8640 == #t~mem75;havoc #t~mem75; {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {16828#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 62: Hoare triple {16828#false} assume !(4 == ~blastFlag~0); {16828#false} is VALID [2022-04-08 08:46:48,553 INFO L290 TraceCheckUtils]: 63: Hoare triple {16828#false} assume !(7 == ~blastFlag~0); {16828#false} is VALID [2022-04-08 08:46:48,554 INFO L290 TraceCheckUtils]: 64: Hoare triple {16828#false} assume !(10 == ~blastFlag~0); {16828#false} is VALID [2022-04-08 08:46:48,554 INFO L290 TraceCheckUtils]: 65: Hoare triple {16828#false} assume 13 == ~blastFlag~0; {16828#false} is VALID [2022-04-08 08:46:48,554 INFO L290 TraceCheckUtils]: 66: Hoare triple {16828#false} assume !false; {16828#false} is VALID [2022-04-08 08:46:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:48,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161883041] [2022-04-08 08:46:48,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161883041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:48,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:48,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:48,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:48,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94449528] [2022-04-08 08:46:48,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94449528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:48,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:48,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383500006] [2022-04-08 08:46:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:48,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:46:48,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:48,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:48,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:48,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:48,614 INFO L87 Difference]: Start difference. First operand 325 states and 490 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:50,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:55,568 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-08 08:46:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:58,183 INFO L93 Difference]: Finished difference Result 689 states and 1050 transitions. [2022-04-08 08:46:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:58,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:46:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-08 08:46:58,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-08 08:46:58,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 614 transitions. [2022-04-08 08:46:58,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:58,635 INFO L225 Difference]: With dead ends: 689 [2022-04-08 08:46:58,635 INFO L226 Difference]: Without dead ends: 523 [2022-04-08 08:46:58,636 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:58,636 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 151 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:58,637 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 366 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 484 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-08 08:46:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-08 08:46:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 326. [2022-04-08 08:46:58,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:58,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:58,658 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:58,658 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:58,672 INFO L93 Difference]: Finished difference Result 523 states and 790 transitions. [2022-04-08 08:46:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 790 transitions. [2022-04-08 08:46:58,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:58,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:58,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 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 523 states. [2022-04-08 08:46:58,675 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 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 523 states. [2022-04-08 08:46:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:58,689 INFO L93 Difference]: Finished difference Result 523 states and 790 transitions. [2022-04-08 08:46:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 790 transitions. [2022-04-08 08:46:58,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:58,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:58,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:58,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 488 transitions. [2022-04-08 08:46:58,699 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 488 transitions. Word has length 67 [2022-04-08 08:46:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:58,699 INFO L478 AbstractCegarLoop]: Abstraction has 326 states and 488 transitions. [2022-04-08 08:46:58,709 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:58,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 488 transitions. [2022-04-08 08:46:59,874 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-08 08:46:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 488 transitions. [2022-04-08 08:46:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:46:59,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:59,878 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:59,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:46:59,878 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash -699706350, now seen corresponding path program 1 times [2022-04-08 08:46:59,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102187318] [2022-04-08 08:47:00,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:47:00,092 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:47:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1464347083, now seen corresponding path program 1 times [2022-04-08 08:47:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:00,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276134825] [2022-04-08 08:47:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:00,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19915#true} is VALID [2022-04-08 08:47:00,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {19915#true} assume true; {19915#true} is VALID [2022-04-08 08:47:00,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19915#true} {19915#true} #708#return; {19915#true} is VALID [2022-04-08 08:47:00,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {19915#true} call ULTIMATE.init(); {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:00,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19915#true} is VALID [2022-04-08 08:47:00,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {19915#true} assume true; {19915#true} is VALID [2022-04-08 08:47:00,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19915#true} {19915#true} #708#return; {19915#true} is VALID [2022-04-08 08:47:00,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {19915#true} call #t~ret161 := main(); {19915#true} is VALID [2022-04-08 08:47:00,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {19915#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19915#true} is VALID [2022-04-08 08:47:00,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {19915#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19915#true} is VALID [2022-04-08 08:47:00,244 INFO L272 TraceCheckUtils]: 7: Hoare triple {19915#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19915#true} is VALID [2022-04-08 08:47:00,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {19915#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {19920#(= ssl3_accept_~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)))); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} [722] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_36|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_368|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_36|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_36|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_34|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_32|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_20|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_36|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_22|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_36|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_32|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_38|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_23|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_33, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_20|, #memory_int=|v_#memory_int_345|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_20|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_368|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_25} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} [721] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,258 INFO L290 TraceCheckUtils]: 45: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,258 INFO L290 TraceCheckUtils]: 46: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:00,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {19916#false} is VALID [2022-04-08 08:47:00,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {19916#false} assume !false; {19916#false} is VALID [2022-04-08 08:47:00,260 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-08 08:47:00,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:00,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276134825] [2022-04-08 08:47:00,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276134825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:00,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:00,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:47:04,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:04,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102187318] [2022-04-08 08:47:04,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102187318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:04,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:04,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:47:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613592749] [2022-04-08 08:47:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:47:04,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:04,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:04,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:04,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:47:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:47:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:47:04,501 INFO L87 Difference]: Start difference. First operand 326 states and 488 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:08,437 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-08 08:47:10,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:12,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:14,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:18,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:23,314 INFO L93 Difference]: Finished difference Result 497 states and 749 transitions. [2022-04-08 08:47:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:47:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:47:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 456 transitions. [2022-04-08 08:47:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 456 transitions. [2022-04-08 08:47:23,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 456 transitions. [2022-04-08 08:47:23,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:23,639 INFO L225 Difference]: With dead ends: 497 [2022-04-08 08:47:23,639 INFO L226 Difference]: Without dead ends: 337 [2022-04-08 08:47:23,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:47:23,640 INFO L913 BasicCegarLoop]: 208 mSDtfsCounter, 9 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:23,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 992 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 731 Invalid, 3 Unknown, 411 Unchecked, 11.5s Time] [2022-04-08 08:47:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-08 08:47:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 328. [2022-04-08 08:47:23,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:23,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:23,658 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:23,659 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:23,666 INFO L93 Difference]: Finished difference Result 337 states and 501 transitions. [2022-04-08 08:47:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2022-04-08 08:47:23,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:23,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:23,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 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 337 states. [2022-04-08 08:47:23,668 INFO L87 Difference]: Start difference. First operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 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 337 states. [2022-04-08 08:47:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:23,674 INFO L93 Difference]: Finished difference Result 337 states and 501 transitions. [2022-04-08 08:47:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2022-04-08 08:47:23,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:23,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:23,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:23,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 491 transitions. [2022-04-08 08:47:23,684 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 491 transitions. Word has length 67 [2022-04-08 08:47:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:23,684 INFO L478 AbstractCegarLoop]: Abstraction has 328 states and 491 transitions. [2022-04-08 08:47:23,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:23,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 328 states and 491 transitions. [2022-04-08 08:47:26,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 490 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 491 transitions. [2022-04-08 08:47:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:47:26,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:26,242 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:26,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:47:26,242 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1228566352, now seen corresponding path program 1 times [2022-04-08 08:47:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:26,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517111098] [2022-04-08 08:47:26,503 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:47:26,503 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:47:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1834174859, now seen corresponding path program 1 times [2022-04-08 08:47:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:26,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970085506] [2022-04-08 08:47:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:26,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22259#true} is VALID [2022-04-08 08:47:26,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {22259#true} assume true; {22259#true} is VALID [2022-04-08 08:47:26,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22259#true} {22259#true} #708#return; {22259#true} is VALID [2022-04-08 08:47:26,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {22259#true} call ULTIMATE.init(); {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:26,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22259#true} is VALID [2022-04-08 08:47:26,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {22259#true} assume true; {22259#true} is VALID [2022-04-08 08:47:26,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22259#true} {22259#true} #708#return; {22259#true} is VALID [2022-04-08 08:47:26,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {22259#true} call #t~ret161 := main(); {22259#true} is VALID [2022-04-08 08:47:26,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {22259#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22259#true} is VALID [2022-04-08 08:47:26,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {22259#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22259#true} is VALID [2022-04-08 08:47:26,667 INFO L272 TraceCheckUtils]: 7: Hoare triple {22259#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22259#true} is VALID [2022-04-08 08:47:26,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {22259#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {22264#(= ssl3_accept_~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)))); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} [724] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_387|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_42|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_42|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_39|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_37|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_24|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_42|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_28|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_42|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_37|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_44|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_27|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_37, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_24|, #memory_int=|v_#memory_int_363|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_387|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_29} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} [723] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:26,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {22260#false} is VALID [2022-04-08 08:47:26,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {22260#false} assume !false; {22260#false} is VALID [2022-04-08 08:47:26,682 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-08 08:47:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:26,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970085506] [2022-04-08 08:47:26,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970085506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:26,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:26,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:47:31,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:31,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517111098] [2022-04-08 08:47:31,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517111098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:31,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:31,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:47:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886943355] [2022-04-08 08:47:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:31,680 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:47:31,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:31,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:31,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:31,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:47:31,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:47:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:47:31,753 INFO L87 Difference]: Start difference. First operand 328 states and 491 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:34,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:39,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:41,161 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-08 08:47:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:47,415 INFO L93 Difference]: Finished difference Result 498 states and 750 transitions. [2022-04-08 08:47:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:47:47,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:47:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 457 transitions. [2022-04-08 08:47:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 457 transitions. [2022-04-08 08:47:47,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 457 transitions. [2022-04-08 08:47:47,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:47,773 INFO L225 Difference]: With dead ends: 498 [2022-04-08 08:47:47,774 INFO L226 Difference]: Without dead ends: 338 [2022-04-08 08:47:47,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:47:47,775 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 10 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:47,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 860 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 629 Invalid, 1 Unknown, 305 Unchecked, 7.7s Time] [2022-04-08 08:47:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-08 08:47:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 326. [2022-04-08 08:47:47,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:47,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:47,795 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:47,795 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:47,803 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-08 08:47:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-08 08:47:47,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:47,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:47,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 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 338 states. [2022-04-08 08:47:47,805 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 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 338 states. [2022-04-08 08:47:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:47,812 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-08 08:47:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-08 08:47:47,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:47,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:47,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:47,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 488 transitions. [2022-04-08 08:47:47,822 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 488 transitions. Word has length 67 [2022-04-08 08:47:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:47,822 INFO L478 AbstractCegarLoop]: Abstraction has 326 states and 488 transitions. [2022-04-08 08:47:47,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:47,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 488 transitions. [2022-04-08 08:47:50,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 487 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 488 transitions. [2022-04-08 08:47:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:47:50,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:50,558 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:50,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:47:50,558 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1333693539, now seen corresponding path program 1 times [2022-04-08 08:47:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:50,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060911502] [2022-04-08 08:47:50,582 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:50,583 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:50,583 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:50,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1333693539, now seen corresponding path program 2 times [2022-04-08 08:47:50,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:50,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988823428] [2022-04-08 08:47:50,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:50,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:50,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24603#true} is VALID [2022-04-08 08:47:50,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {24603#true} assume true; {24603#true} is VALID [2022-04-08 08:47:50,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24603#true} {24603#true} #708#return; {24603#true} is VALID [2022-04-08 08:47:50,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {24603#true} call ULTIMATE.init(); {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:50,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24603#true} is VALID [2022-04-08 08:47:50,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {24603#true} assume true; {24603#true} is VALID [2022-04-08 08:47:50,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24603#true} {24603#true} #708#return; {24603#true} is VALID [2022-04-08 08:47:50,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {24603#true} call #t~ret161 := main(); {24603#true} is VALID [2022-04-08 08:47:50,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {24603#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {24603#true} is VALID [2022-04-08 08:47:50,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {24603#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24603#true} is VALID [2022-04-08 08:47:50,806 INFO L272 TraceCheckUtils]: 7: Hoare triple {24603#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24603#true} is VALID [2022-04-08 08:47:50,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {24603#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:50,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24609#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 08:47:50,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {24609#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {24604#false} is VALID [2022-04-08 08:47:50,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {24604#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {24604#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24604#false} is VALID [2022-04-08 08:47:50,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {24604#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {24604#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {24604#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {24604#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {24604#false} assume 12292 != #t~mem85;havoc #t~mem85; {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {24604#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {24604#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {24604#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {24604#false} ~skip~0 := 0; {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {24604#false} assume !false; {24604#false} is VALID [2022-04-08 08:47:50,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {24604#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {24604#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {24604#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {24604#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {24604#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {24604#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 38: Hoare triple {24604#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {24604#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {24604#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {24604#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {24604#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {24604#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {24604#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {24604#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {24604#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {24604#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {24604#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {24604#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {24604#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {24604#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,821 INFO L290 TraceCheckUtils]: 52: Hoare triple {24604#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {24604#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {24604#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 55: Hoare triple {24604#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {24604#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {24604#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {24604#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {24604#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {24604#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {24604#false} assume 8640 == #t~mem75;havoc #t~mem75; {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {24604#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {24604#false} is VALID [2022-04-08 08:47:50,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {24604#false} assume !(4 == ~blastFlag~0); {24604#false} is VALID [2022-04-08 08:47:50,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {24604#false} assume !(7 == ~blastFlag~0); {24604#false} is VALID [2022-04-08 08:47:50,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {24604#false} assume !(10 == ~blastFlag~0); {24604#false} is VALID [2022-04-08 08:47:50,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {24604#false} assume 13 == ~blastFlag~0; {24604#false} is VALID [2022-04-08 08:47:50,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {24604#false} assume !false; {24604#false} is VALID [2022-04-08 08:47:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:47:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988823428] [2022-04-08 08:47:50,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988823428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:50,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:50,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:50,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:50,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060911502] [2022-04-08 08:47:50,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060911502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:50,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:50,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410482880] [2022-04-08 08:47:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:47:50,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:50,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:50,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:50,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:50,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:50,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:50,891 INFO L87 Difference]: Start difference. First operand 326 states and 488 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:52,965 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-08 08:47:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:56,221 INFO L93 Difference]: Finished difference Result 509 states and 763 transitions. [2022-04-08 08:47:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:56,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:47:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:47:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:47:56,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-08 08:47:56,551 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-08 08:47:56,556 INFO L225 Difference]: With dead ends: 509 [2022-04-08 08:47:56,556 INFO L226 Difference]: Without dead ends: 342 [2022-04-08 08:47:56,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:56,557 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 21 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:56,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 509 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:47:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-08 08:47:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 326. [2022-04-08 08:47:56,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:56,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:56,576 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:56,576 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:56,583 INFO L93 Difference]: Finished difference Result 342 states and 506 transitions. [2022-04-08 08:47:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 506 transitions. [2022-04-08 08:47:56,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:56,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:56,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 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 342 states. [2022-04-08 08:47:56,585 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 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 342 states. [2022-04-08 08:47:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:56,592 INFO L93 Difference]: Finished difference Result 342 states and 506 transitions. [2022-04-08 08:47:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 506 transitions. [2022-04-08 08:47:56,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:56,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:56,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:56,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 487 transitions. [2022-04-08 08:47:56,601 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 487 transitions. Word has length 68 [2022-04-08 08:47:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:56,602 INFO L478 AbstractCegarLoop]: Abstraction has 326 states and 487 transitions. [2022-04-08 08:47:56,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:56,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 487 transitions. [2022-04-08 08:47:59,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 486 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 487 transitions. [2022-04-08 08:47:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:47:59,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:59,323 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:59,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:47:59,323 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1680521453, now seen corresponding path program 1 times [2022-04-08 08:47:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:59,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [420847367] [2022-04-08 08:47:59,600 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:47:59,600 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:47:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2090964661, now seen corresponding path program 1 times [2022-04-08 08:47:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:59,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33824755] [2022-04-08 08:47:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:59,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26969#true} is VALID [2022-04-08 08:47:59,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {26969#true} assume true; {26969#true} is VALID [2022-04-08 08:47:59,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26969#true} {26969#true} #708#return; {26969#true} is VALID [2022-04-08 08:47:59,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {26969#true} call ULTIMATE.init(); {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:59,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26969#true} is VALID [2022-04-08 08:47:59,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {26969#true} assume true; {26969#true} is VALID [2022-04-08 08:47:59,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26969#true} {26969#true} #708#return; {26969#true} is VALID [2022-04-08 08:47:59,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {26969#true} call #t~ret161 := main(); {26969#true} is VALID [2022-04-08 08:47:59,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {26969#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {26969#true} is VALID [2022-04-08 08:47:59,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {26969#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26969#true} is VALID [2022-04-08 08:47:59,777 INFO L272 TraceCheckUtils]: 7: Hoare triple {26969#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26969#true} is VALID [2022-04-08 08:47:59,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {26969#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {26974#(= ssl3_accept_~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)))); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} [726] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_50|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_427|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_50|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_50|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_46|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_8|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_44|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_22|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_28|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_50|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_36|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_50|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_44|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_52|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_32|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_42, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_28|, #memory_int=|v_#memory_int_392|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_28|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_427|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_34} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} [725] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,790 INFO L290 TraceCheckUtils]: 49: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:47:59,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {26970#false} is VALID [2022-04-08 08:47:59,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {26970#false} assume !false; {26970#false} is VALID [2022-04-08 08:47:59,790 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-08 08:47:59,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:59,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33824755] [2022-04-08 08:47:59,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33824755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:59,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:59,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:48:04,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:04,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [420847367] [2022-04-08 08:48:04,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [420847367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:04,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:04,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:48:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713688709] [2022-04-08 08:48:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:48:04,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:04,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:04,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:04,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:48:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:48:04,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:48:04,222 INFO L87 Difference]: Start difference. First operand 326 states and 487 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:06,336 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-08 08:48:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:14,575 INFO L93 Difference]: Finished difference Result 498 states and 750 transitions. [2022-04-08 08:48:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:48:14,575 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:48:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 617 transitions. [2022-04-08 08:48:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 617 transitions. [2022-04-08 08:48:14,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 617 transitions. [2022-04-08 08:48:15,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:15,031 INFO L225 Difference]: With dead ends: 498 [2022-04-08 08:48:15,031 INFO L226 Difference]: Without dead ends: 338 [2022-04-08 08:48:15,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:48:15,032 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 143 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:15,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 972 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1051 Invalid, 1 Unknown, 153 Unchecked, 4.8s Time] [2022-04-08 08:48:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-08 08:48:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 328. [2022-04-08 08:48:15,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:15,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:15,051 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:15,052 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:15,059 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-08 08:48:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-08 08:48:15,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:15,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:15,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 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 338 states. [2022-04-08 08:48:15,061 INFO L87 Difference]: Start difference. First operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 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 338 states. [2022-04-08 08:48:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:15,068 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-08 08:48:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-08 08:48:15,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:15,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:15,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:15,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 490 transitions. [2022-04-08 08:48:15,077 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 490 transitions. Word has length 68 [2022-04-08 08:48:15,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:15,078 INFO L478 AbstractCegarLoop]: Abstraction has 328 states and 490 transitions. [2022-04-08 08:48:15,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:15,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 328 states and 490 transitions. [2022-04-08 08:48:17,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 489 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 490 transitions. [2022-04-08 08:48:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:48:17,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:17,731 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:17,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:48:17,731 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:17,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:17,731 INFO L85 PathProgramCache]: Analyzing trace with hash -686173141, now seen corresponding path program 1 times [2022-04-08 08:48:17,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:17,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082310539] [2022-04-08 08:48:18,037 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:48:18,037 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:48:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1721136885, now seen corresponding path program 1 times [2022-04-08 08:48:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:18,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934192567] [2022-04-08 08:48:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:18,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:18,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29318#true} is VALID [2022-04-08 08:48:18,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {29318#true} assume true; {29318#true} is VALID [2022-04-08 08:48:18,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29318#true} {29318#true} #708#return; {29318#true} is VALID [2022-04-08 08:48:18,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {29318#true} call ULTIMATE.init(); {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:18,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29318#true} is VALID [2022-04-08 08:48:18,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {29318#true} assume true; {29318#true} is VALID [2022-04-08 08:48:18,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29318#true} {29318#true} #708#return; {29318#true} is VALID [2022-04-08 08:48:18,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {29318#true} call #t~ret161 := main(); {29318#true} is VALID [2022-04-08 08:48:18,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {29318#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {29318#true} is VALID [2022-04-08 08:48:18,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {29318#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29318#true} is VALID [2022-04-08 08:48:18,214 INFO L272 TraceCheckUtils]: 7: Hoare triple {29318#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29318#true} is VALID [2022-04-08 08:48:18,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {29318#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {29323#(= ssl3_accept_~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)))); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} [728] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_56|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_446|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_56|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_56|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_51|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_14|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_49|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_28|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_32|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_56|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_42|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_56|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_49|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_58|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_36|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_46, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_32|, #memory_int=|v_#memory_int_410|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_32|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_446|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_38} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} [727] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:48:18,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {29319#false} is VALID [2022-04-08 08:48:18,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {29319#false} assume !false; {29319#false} is VALID [2022-04-08 08:48:18,230 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-08 08:48:18,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:18,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934192567] [2022-04-08 08:48:18,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934192567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:18,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:18,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:48:22,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:22,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082310539] [2022-04-08 08:48:22,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082310539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:22,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:22,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:48:22,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716191306] [2022-04-08 08:48:22,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:48:22,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:22,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:22,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:22,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:48:22,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:22,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:48:22,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:48:22,263 INFO L87 Difference]: Start difference. First operand 328 states and 490 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:24,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:26,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:30,311 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-08 08:48:35,140 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-08 08:48:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:44,502 INFO L93 Difference]: Finished difference Result 665 states and 1008 transitions. [2022-04-08 08:48:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:48:44,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:48:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 649 transitions. [2022-04-08 08:48:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 649 transitions. [2022-04-08 08:48:44,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 649 transitions. [2022-04-08 08:48:44,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:44,998 INFO L225 Difference]: With dead ends: 665 [2022-04-08 08:48:44,998 INFO L226 Difference]: Without dead ends: 505 [2022-04-08 08:48:44,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:48:44,999 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 159 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:44,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 977 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1023 Invalid, 3 Unknown, 180 Unchecked, 12.1s Time] [2022-04-08 08:48:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-08 08:48:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 483. [2022-04-08 08:48:45,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:45,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:45,024 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:45,025 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:45,038 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2022-04-08 08:48:45,038 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 746 transitions. [2022-04-08 08:48:45,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:45,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:45,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 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 505 states. [2022-04-08 08:48:45,040 INFO L87 Difference]: Start difference. First operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 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 505 states. [2022-04-08 08:48:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:45,053 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2022-04-08 08:48:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 746 transitions. [2022-04-08 08:48:45,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:45,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:45,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:45,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 719 transitions. [2022-04-08 08:48:45,071 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 719 transitions. Word has length 68 [2022-04-08 08:48:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:45,072 INFO L478 AbstractCegarLoop]: Abstraction has 483 states and 719 transitions. [2022-04-08 08:48:45,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:45,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 483 states and 719 transitions. [2022-04-08 08:48:48,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 719 edges. 718 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 719 transitions. [2022-04-08 08:48:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:48:48,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:48,043 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:48,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:48:48,043 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1132379676, now seen corresponding path program 1 times [2022-04-08 08:48:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [101690962] [2022-04-08 08:48:48,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:48,064 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:48,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1132379676, now seen corresponding path program 2 times [2022-04-08 08:48:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:48,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466943127] [2022-04-08 08:48:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:48,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32645#true} is VALID [2022-04-08 08:48:48,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {32645#true} assume true; {32645#true} is VALID [2022-04-08 08:48:48,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32645#true} {32645#true} #708#return; {32645#true} is VALID [2022-04-08 08:48:48,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {32645#true} call ULTIMATE.init(); {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {32645#true} assume true; {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32645#true} {32645#true} #708#return; {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {32645#true} call #t~ret161 := main(); {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {32645#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {32645#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L272 TraceCheckUtils]: 7: Hoare triple {32645#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {32645#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {32645#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {32645#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {32645#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {32645#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {32645#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {32645#true} is VALID [2022-04-08 08:48:48,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {32645#true} assume !false; {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {32645#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {32645#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {32645#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {32645#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {32645#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {32645#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {32645#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {32645#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {32645#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {32645#true} assume 8464 == #t~mem55;havoc #t~mem55; {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {32645#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32645#true} is VALID [2022-04-08 08:48:48,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {32645#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32645#true} is VALID [2022-04-08 08:48:48,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {32645#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:48,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32651#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:48:48,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {32651#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {32646#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {32646#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {32646#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {32646#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {32646#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {32646#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {32646#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {32646#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {32646#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {32646#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {32646#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {32646#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {32646#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {32646#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {32646#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {32646#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 61: Hoare triple {32646#false} assume 8640 == #t~mem75;havoc #t~mem75; {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {32646#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {32646#false} assume !(4 == ~blastFlag~0); {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 64: Hoare triple {32646#false} assume !(7 == ~blastFlag~0); {32646#false} is VALID [2022-04-08 08:48:48,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {32646#false} assume !(10 == ~blastFlag~0); {32646#false} is VALID [2022-04-08 08:48:48,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {32646#false} assume 13 == ~blastFlag~0; {32646#false} is VALID [2022-04-08 08:48:48,287 INFO L290 TraceCheckUtils]: 67: Hoare triple {32646#false} assume !false; {32646#false} is VALID [2022-04-08 08:48:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:48:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:48,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466943127] [2022-04-08 08:48:48,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466943127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:48,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:48,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:48,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:48,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [101690962] [2022-04-08 08:48:48,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [101690962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:48,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:48,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:48,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680597312] [2022-04-08 08:48:48,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:48,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:48:48,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:48,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:48,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:48,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:48,351 INFO L87 Difference]: Start difference. First operand 483 states and 719 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:51,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:56,451 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-08 08:48:58,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:03,188 INFO L93 Difference]: Finished difference Result 686 states and 1029 transitions. [2022-04-08 08:49:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:49:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2022-04-08 08:49:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2022-04-08 08:49:03,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 490 transitions. [2022-04-08 08:49:03,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:03,533 INFO L225 Difference]: With dead ends: 686 [2022-04-08 08:49:03,533 INFO L226 Difference]: Without dead ends: 526 [2022-04-08 08:49:03,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:03,534 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 31 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:03,534 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 615 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-08 08:49:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-04-08 08:49:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 505. [2022-04-08 08:49:03,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:03,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,560 INFO L74 IsIncluded]: Start isIncluded. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,561 INFO L87 Difference]: Start difference. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:03,575 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2022-04-08 08:49:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 781 transitions. [2022-04-08 08:49:03,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:03,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:03,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 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 526 states. [2022-04-08 08:49:03,577 INFO L87 Difference]: Start difference. First operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 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 526 states. [2022-04-08 08:49:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:03,591 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2022-04-08 08:49:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 781 transitions. [2022-04-08 08:49:03,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:03,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:03,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:03,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 754 transitions. [2022-04-08 08:49:03,610 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 754 transitions. Word has length 68 [2022-04-08 08:49:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:03,610 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 754 transitions. [2022-04-08 08:49:03,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 754 transitions. [2022-04-08 08:49:06,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 754 edges. 753 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 754 transitions. [2022-04-08 08:49:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 08:49:06,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:06,849 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:06,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:49:06,849 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1067744169, now seen corresponding path program 1 times [2022-04-08 08:49:06,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:06,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [863783226] [2022-04-08 08:49:06,885 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:06,885 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:06,885 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1067744169, now seen corresponding path program 2 times [2022-04-08 08:49:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:06,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396292714] [2022-04-08 08:49:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:07,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:07,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36091#true} is VALID [2022-04-08 08:49:07,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {36091#true} assume true; {36091#true} is VALID [2022-04-08 08:49:07,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36091#true} {36091#true} #708#return; {36091#true} is VALID [2022-04-08 08:49:07,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {36091#true} call ULTIMATE.init(); {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:49:07,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36091#true} is VALID [2022-04-08 08:49:07,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {36091#true} assume true; {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36091#true} {36091#true} #708#return; {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {36091#true} call #t~ret161 := main(); {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {36091#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {36091#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L272 TraceCheckUtils]: 7: Hoare triple {36091#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {36091#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {36091#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {36091#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {36091#true} is VALID [2022-04-08 08:49:07,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {36091#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {36091#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {36091#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {36091#true} assume !false; {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {36091#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {36091#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {36091#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {36091#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {36091#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {36091#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {36091#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {36091#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {36091#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {36091#true} assume 8464 == #t~mem55;havoc #t~mem55; {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {36091#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {36091#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {36091#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {36091#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {36091#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {36091#true} ~skip~0 := 0; {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {36091#true} assume !false; {36091#true} is VALID [2022-04-08 08:49:07,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {36091#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {36091#true} assume 12292 == #t~mem47;havoc #t~mem47; {36091#true} is VALID [2022-04-08 08:49:07,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {36091#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {36091#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {36091#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36091#true} is VALID [2022-04-08 08:49:07,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {36091#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {36091#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {36091#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {36091#true} is VALID [2022-04-08 08:49:07,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {36091#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-08 08:49:07,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {36091#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:07,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36097#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {36097#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {36092#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {36092#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {36092#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {36092#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {36092#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {36092#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {36092#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 60: Hoare triple {36092#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {36092#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 62: Hoare triple {36092#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {36092#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {36092#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {36092#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 66: Hoare triple {36092#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {36092#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {36092#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {36092#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 70: Hoare triple {36092#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {36092#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {36092#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 73: Hoare triple {36092#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 74: Hoare triple {36092#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {36092#false} assume 8640 == #t~mem75;havoc #t~mem75; {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {36092#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {36092#false} assume !(4 == ~blastFlag~0); {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {36092#false} assume !(7 == ~blastFlag~0); {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 79: Hoare triple {36092#false} assume !(10 == ~blastFlag~0); {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 80: Hoare triple {36092#false} assume 13 == ~blastFlag~0; {36092#false} is VALID [2022-04-08 08:49:07,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {36092#false} assume !false; {36092#false} is VALID [2022-04-08 08:49:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:49:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:07,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396292714] [2022-04-08 08:49:07,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396292714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:07,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:07,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:07,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:07,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [863783226] [2022-04-08 08:49:07,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [863783226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:07,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:07,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971928836] [2022-04-08 08:49:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:07,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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 82 [2022-04-08 08:49:07,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:07,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:49:07,214 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-08 08:49:07,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:07,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:07,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:07,215 INFO L87 Difference]: Start difference. First operand 505 states and 754 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:49:09,311 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-08 08:49:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:14,088 INFO L93 Difference]: Finished difference Result 890 states and 1329 transitions. [2022-04-08 08:49:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:14,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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 82 [2022-04-08 08:49:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:14,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:49:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-08 08:49:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:49:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-08 08:49:14,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-08 08:49:14,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:14,419 INFO L225 Difference]: With dead ends: 890 [2022-04-08 08:49:14,419 INFO L226 Difference]: Without dead ends: 544 [2022-04-08 08:49:14,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:14,420 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 20 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:14,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 598 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 404 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 08:49:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-04-08 08:49:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 511. [2022-04-08 08:49:14,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:14,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:14,445 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:14,446 INFO L87 Difference]: Start difference. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:14,460 INFO L93 Difference]: Finished difference Result 544 states and 805 transitions. [2022-04-08 08:49:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 805 transitions. [2022-04-08 08:49:14,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:14,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:14,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 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 544 states. [2022-04-08 08:49:14,462 INFO L87 Difference]: Start difference. First operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 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 544 states. [2022-04-08 08:49:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:14,477 INFO L93 Difference]: Finished difference Result 544 states and 805 transitions. [2022-04-08 08:49:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 805 transitions. [2022-04-08 08:49:14,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:14,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:14,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:14,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 764 transitions. [2022-04-08 08:49:14,492 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 764 transitions. Word has length 82 [2022-04-08 08:49:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:14,492 INFO L478 AbstractCegarLoop]: Abstraction has 511 states and 764 transitions. [2022-04-08 08:49:14,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:49:14,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 764 transitions. [2022-04-08 08:49:17,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 763 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 764 transitions. [2022-04-08 08:49:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 08:49:17,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:17,499 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:17,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:49:17,499 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1797161388, now seen corresponding path program 1 times [2022-04-08 08:49:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:17,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1306175316] [2022-04-08 08:49:17,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:17,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:17,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1797161388, now seen corresponding path program 2 times [2022-04-08 08:49:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:17,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585442195] [2022-04-08 08:49:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:17,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39993#true} is VALID [2022-04-08 08:49:17,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {39993#true} assume true; {39993#true} is VALID [2022-04-08 08:49:17,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39993#true} {39993#true} #708#return; {39993#true} is VALID [2022-04-08 08:49:17,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {39993#true} call ULTIMATE.init(); {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:49:17,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39993#true} is VALID [2022-04-08 08:49:17,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {39993#true} assume true; {39993#true} is VALID [2022-04-08 08:49:17,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39993#true} {39993#true} #708#return; {39993#true} is VALID [2022-04-08 08:49:17,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {39993#true} call #t~ret161 := main(); {39993#true} is VALID [2022-04-08 08:49:17,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {39993#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {39993#true} is VALID [2022-04-08 08:49:17,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {39993#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,803 INFO L272 TraceCheckUtils]: 7: Hoare triple {39993#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {39993#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {39993#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {39993#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {39993#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {39993#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {39993#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {39993#true} assume !false; {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {39993#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {39993#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {39993#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {39993#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {39993#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {39993#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {39993#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {39993#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {39993#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {39993#true} assume 8464 == #t~mem55;havoc #t~mem55; {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {39993#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {39993#true} is VALID [2022-04-08 08:49:17,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {39993#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39993#true} is VALID [2022-04-08 08:49:17,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {39993#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:49:17,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {39998#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39999#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 08:49:17,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {39999#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {39994#false} is VALID [2022-04-08 08:49:17,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {39994#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {39994#false} is VALID [2022-04-08 08:49:17,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {39994#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {39994#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {39994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {39994#false} ~skip~0 := 0; {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {39994#false} assume !false; {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {39994#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {39994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {39994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {39994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {39994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {39994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {39994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {39994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {39994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {39994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {39994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {39994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {39994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {39994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {39994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {39994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {39994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {39994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {39994#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {39994#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 66: Hoare triple {39994#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 67: Hoare triple {39994#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {39994#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 69: Hoare triple {39994#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 70: Hoare triple {39994#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 71: Hoare triple {39994#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,815 INFO L290 TraceCheckUtils]: 72: Hoare triple {39994#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {39994#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {39994#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 75: Hoare triple {39994#false} assume 8640 == #t~mem75;havoc #t~mem75; {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 76: Hoare triple {39994#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 77: Hoare triple {39994#false} assume !(4 == ~blastFlag~0); {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {39994#false} assume !(7 == ~blastFlag~0); {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {39994#false} assume !(10 == ~blastFlag~0); {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {39994#false} assume 13 == ~blastFlag~0; {39994#false} is VALID [2022-04-08 08:49:17,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {39994#false} assume !false; {39994#false} is VALID [2022-04-08 08:49:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:49:17,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:17,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585442195] [2022-04-08 08:49:17,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585442195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:17,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:17,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:17,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:17,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1306175316] [2022-04-08 08:49:17,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1306175316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:17,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:17,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:17,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893847450] [2022-04-08 08:49:17,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 82 [2022-04-08 08:49:17,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:17,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:17,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:17,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:17,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:17,890 INFO L87 Difference]: Start difference. First operand 511 states and 764 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:19,985 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-08 08:49:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:24,857 INFO L93 Difference]: Finished difference Result 1296 states and 1948 transitions. [2022-04-08 08:49:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:24,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 82 [2022-04-08 08:49:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-08 08:49:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-08 08:49:24,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 613 transitions. [2022-04-08 08:49:25,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:25,316 INFO L225 Difference]: With dead ends: 1296 [2022-04-08 08:49:25,316 INFO L226 Difference]: Without dead ends: 811 [2022-04-08 08:49:25,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:25,317 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 147 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:25,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 366 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 08:49:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-04-08 08:49:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 514. [2022-04-08 08:49:25,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:25,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 811 states. Second operand has 514 states, 509 states have (on average 1.4950884086444007) internal successors, (761), 509 states have internal predecessors, (761), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:25,346 INFO L74 IsIncluded]: Start isIncluded. First operand 811 states. Second operand has 514 states, 509 states have (on average 1.4950884086444007) internal successors, (761), 509 states have internal predecessors, (761), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:25,347 INFO L87 Difference]: Start difference. First operand 811 states. Second operand has 514 states, 509 states have (on average 1.4950884086444007) internal successors, (761), 509 states have internal predecessors, (761), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:25,378 INFO L93 Difference]: Finished difference Result 811 states and 1212 transitions. [2022-04-08 08:49:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1212 transitions. [2022-04-08 08:49:25,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:25,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:25,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 514 states, 509 states have (on average 1.4950884086444007) internal successors, (761), 509 states have internal predecessors, (761), 3 states have call successors, (3), 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 811 states. [2022-04-08 08:49:25,380 INFO L87 Difference]: Start difference. First operand has 514 states, 509 states have (on average 1.4950884086444007) internal successors, (761), 509 states have internal predecessors, (761), 3 states have call successors, (3), 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 811 states. [2022-04-08 08:49:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:25,411 INFO L93 Difference]: Finished difference Result 811 states and 1212 transitions. [2022-04-08 08:49:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1212 transitions. [2022-04-08 08:49:25,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:25,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:25,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:25,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 509 states have (on average 1.4950884086444007) internal successors, (761), 509 states have internal predecessors, (761), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 765 transitions. [2022-04-08 08:49:25,430 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 765 transitions. Word has length 82 [2022-04-08 08:49:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:25,431 INFO L478 AbstractCegarLoop]: Abstraction has 514 states and 765 transitions. [2022-04-08 08:49:25,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:25,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 514 states and 765 transitions. [2022-04-08 08:49:28,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 765 edges. 764 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 765 transitions. [2022-04-08 08:49:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 08:49:28,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:28,468 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:28,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:49:28,468 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash -403445877, now seen corresponding path program 1 times [2022-04-08 08:49:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:28,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1064406500] [2022-04-08 08:49:28,505 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:28,506 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:28,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:28,506 INFO L85 PathProgramCache]: Analyzing trace with hash -403445877, now seen corresponding path program 2 times [2022-04-08 08:49:28,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:28,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339748653] [2022-04-08 08:49:28,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:28,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:28,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {45254#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45247#true} is VALID [2022-04-08 08:49:28,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {45247#true} assume true; {45247#true} is VALID [2022-04-08 08:49:28,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45247#true} {45247#true} #708#return; {45247#true} is VALID [2022-04-08 08:49:28,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {45247#true} call ULTIMATE.init(); {45254#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:49:28,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {45254#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45247#true} is VALID [2022-04-08 08:49:28,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {45247#true} assume true; {45247#true} is VALID [2022-04-08 08:49:28,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45247#true} {45247#true} #708#return; {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {45247#true} call #t~ret161 := main(); {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {45247#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {45247#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L272 TraceCheckUtils]: 7: Hoare triple {45247#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {45247#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {45247#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {45247#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {45247#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45247#true} is VALID [2022-04-08 08:49:28,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {45247#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {45247#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {45247#true} assume !false; {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {45247#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {45247#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {45247#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {45247#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {45247#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {45247#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {45247#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {45247#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {45247#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45247#true} is VALID [2022-04-08 08:49:28,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {45247#true} assume 8464 == #t~mem55;havoc #t~mem55; {45247#true} is VALID [2022-04-08 08:49:28,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {45247#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45247#true} is VALID [2022-04-08 08:49:28,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {45247#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45247#true} is VALID [2022-04-08 08:49:28,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {45247#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:28,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {45252#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45253#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {45253#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {45248#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {45248#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {45248#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {45248#false} ~skip~0 := 0; {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {45248#false} assume !false; {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {45248#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {45248#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {45248#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {45248#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {45248#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {45248#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {45248#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {45248#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {45248#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {45248#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {45248#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {45248#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {45248#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {45248#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {45248#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {45248#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {45248#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {45248#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {45248#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {45248#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {45248#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {45248#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {45248#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {45248#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {45248#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 71: Hoare triple {45248#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 72: Hoare triple {45248#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 73: Hoare triple {45248#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {45248#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {45248#false} assume 8640 == #t~mem75;havoc #t~mem75; {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {45248#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {45248#false} is VALID [2022-04-08 08:49:28,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {45248#false} assume !(4 == ~blastFlag~0); {45248#false} is VALID [2022-04-08 08:49:28,738 INFO L290 TraceCheckUtils]: 78: Hoare triple {45248#false} assume !(7 == ~blastFlag~0); {45248#false} is VALID [2022-04-08 08:49:28,738 INFO L290 TraceCheckUtils]: 79: Hoare triple {45248#false} assume !(10 == ~blastFlag~0); {45248#false} is VALID [2022-04-08 08:49:28,738 INFO L290 TraceCheckUtils]: 80: Hoare triple {45248#false} assume 13 == ~blastFlag~0; {45248#false} is VALID [2022-04-08 08:49:28,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {45248#false} assume !false; {45248#false} is VALID [2022-04-08 08:49:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:49:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:28,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339748653] [2022-04-08 08:49:28,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339748653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:28,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:28,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:28,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:28,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1064406500] [2022-04-08 08:49:28,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1064406500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:28,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:28,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988741131] [2022-04-08 08:49:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 82 [2022-04-08 08:49:28,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:28,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:28,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:28,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:28,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:28,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:28,797 INFO L87 Difference]: Start difference. First operand 514 states and 765 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:30,874 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-08 08:49:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:36,017 INFO L93 Difference]: Finished difference Result 718 states and 1076 transitions. [2022-04-08 08:49:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:36,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 82 [2022-04-08 08:49:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-04-08 08:49:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-04-08 08:49:36,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 485 transitions. [2022-04-08 08:49:36,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:36,370 INFO L225 Difference]: With dead ends: 718 [2022-04-08 08:49:36,370 INFO L226 Difference]: Without dead ends: 532 [2022-04-08 08:49:36,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:36,371 INFO L913 BasicCegarLoop]: 246 mSDtfsCounter, 33 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:36,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 613 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 439 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 08:49:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-08 08:49:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 514. [2022-04-08 08:49:36,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:36,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 514 states, 509 states have (on average 1.493123772102161) internal successors, (760), 509 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:36,400 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 514 states, 509 states have (on average 1.493123772102161) internal successors, (760), 509 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:36,401 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 514 states, 509 states have (on average 1.493123772102161) internal successors, (760), 509 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:36,414 INFO L93 Difference]: Finished difference Result 532 states and 788 transitions. [2022-04-08 08:49:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 788 transitions. [2022-04-08 08:49:36,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:36,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:36,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 514 states, 509 states have (on average 1.493123772102161) internal successors, (760), 509 states have internal predecessors, (760), 3 states have call successors, (3), 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 532 states. [2022-04-08 08:49:36,417 INFO L87 Difference]: Start difference. First operand has 514 states, 509 states have (on average 1.493123772102161) internal successors, (760), 509 states have internal predecessors, (760), 3 states have call successors, (3), 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 532 states. [2022-04-08 08:49:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:36,438 INFO L93 Difference]: Finished difference Result 532 states and 788 transitions. [2022-04-08 08:49:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 788 transitions. [2022-04-08 08:49:36,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:36,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:36,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:36,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 509 states have (on average 1.493123772102161) internal successors, (760), 509 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 764 transitions. [2022-04-08 08:49:36,457 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 764 transitions. Word has length 82 [2022-04-08 08:49:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:36,458 INFO L478 AbstractCegarLoop]: Abstraction has 514 states and 764 transitions. [2022-04-08 08:49:36,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:36,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 514 states and 764 transitions. [2022-04-08 08:49:39,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 763 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 764 transitions. [2022-04-08 08:49:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 08:49:39,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:39,530 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:39,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:49:39,530 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1485544258, now seen corresponding path program 1 times [2022-04-08 08:49:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:39,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138964913] [2022-04-08 08:49:39,572 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:39,572 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:39,572 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:39,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1485544258, now seen corresponding path program 2 times [2022-04-08 08:49:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:39,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326630286] [2022-04-08 08:49:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:39,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:39,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {48795#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48787#true} is VALID [2022-04-08 08:49:39,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {48787#true} assume true; {48787#true} is VALID [2022-04-08 08:49:39,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48787#true} {48787#true} #708#return; {48787#true} is VALID [2022-04-08 08:49:39,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {48787#true} call ULTIMATE.init(); {48795#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:49:39,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {48795#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48787#true} is VALID [2022-04-08 08:49:39,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {48787#true} assume true; {48787#true} is VALID [2022-04-08 08:49:39,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48787#true} {48787#true} #708#return; {48787#true} is VALID [2022-04-08 08:49:39,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {48787#true} call #t~ret161 := main(); {48787#true} is VALID [2022-04-08 08:49:39,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {48787#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48787#true} is VALID [2022-04-08 08:49:39,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {48787#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,903 INFO L272 TraceCheckUtils]: 7: Hoare triple {48787#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {48787#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {48787#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {48787#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {48787#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {48787#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {48787#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {48787#true} assume !false; {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {48787#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {48787#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {48787#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {48787#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {48787#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {48787#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {48787#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {48787#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {48787#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {48787#true} assume 8464 == #t~mem55;havoc #t~mem55; {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {48787#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {48787#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {48787#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {48787#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48787#true} is VALID [2022-04-08 08:49:39,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {48787#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48787#true} is VALID [2022-04-08 08:49:39,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {48787#true} ~skip~0 := 0; {48787#true} is VALID [2022-04-08 08:49:39,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {48787#true} assume !false; {48787#true} is VALID [2022-04-08 08:49:39,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {48787#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48792#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:39,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {48792#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:39,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:39,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:39,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:39,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:39,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:39,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:39,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {48793#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {48794#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-08 08:49:39,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {48794#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {48788#false} is VALID [2022-04-08 08:49:39,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {48788#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {48788#false} is VALID [2022-04-08 08:49:39,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {48788#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {48788#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48788#false} is VALID [2022-04-08 08:49:39,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {48788#false} ~skip~0 := 0; {48788#false} is VALID [2022-04-08 08:49:39,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {48788#false} assume !false; {48788#false} is VALID [2022-04-08 08:49:39,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {48788#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {48788#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {48788#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {48788#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {48788#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {48788#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {48788#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {48788#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {48788#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,918 INFO L290 TraceCheckUtils]: 56: Hoare triple {48788#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 57: Hoare triple {48788#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 58: Hoare triple {48788#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {48788#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 60: Hoare triple {48788#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {48788#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {48788#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 63: Hoare triple {48788#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 64: Hoare triple {48788#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {48788#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {48788#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {48788#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {48788#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 69: Hoare triple {48788#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {48788#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 71: Hoare triple {48788#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 72: Hoare triple {48788#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {48788#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {48788#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {48788#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {48788#false} is VALID [2022-04-08 08:49:39,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {48788#false} assume 8640 == #t~mem75;havoc #t~mem75; {48788#false} is VALID [2022-04-08 08:49:39,921 INFO L290 TraceCheckUtils]: 77: Hoare triple {48788#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {48788#false} is VALID [2022-04-08 08:49:39,921 INFO L290 TraceCheckUtils]: 78: Hoare triple {48788#false} assume !(4 == ~blastFlag~0); {48788#false} is VALID [2022-04-08 08:49:39,921 INFO L290 TraceCheckUtils]: 79: Hoare triple {48788#false} assume !(7 == ~blastFlag~0); {48788#false} is VALID [2022-04-08 08:49:39,921 INFO L290 TraceCheckUtils]: 80: Hoare triple {48788#false} assume !(10 == ~blastFlag~0); {48788#false} is VALID [2022-04-08 08:49:39,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {48788#false} assume 13 == ~blastFlag~0; {48788#false} is VALID [2022-04-08 08:49:39,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {48788#false} assume !false; {48788#false} is VALID [2022-04-08 08:49:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:49:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:39,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326630286] [2022-04-08 08:49:39,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326630286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:39,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:39,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:49:39,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:39,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138964913] [2022-04-08 08:49:39,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138964913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:39,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:39,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:49:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075064149] [2022-04-08 08:49:39,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:39,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 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 83 [2022-04-08 08:49:39,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:39,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:39,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:39,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:49:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:39,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:49:39,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:39,985 INFO L87 Difference]: Start difference. First operand 514 states and 764 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:42,088 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-08 08:49:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:47,870 INFO L93 Difference]: Finished difference Result 886 states and 1320 transitions. [2022-04-08 08:49:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:49:47,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 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 83 [2022-04-08 08:49:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2022-04-08 08:49:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2022-04-08 08:49:47,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 439 transitions. [2022-04-08 08:49:48,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:48,172 INFO L225 Difference]: With dead ends: 886 [2022-04-08 08:49:48,172 INFO L226 Difference]: Without dead ends: 532 [2022-04-08 08:49:48,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:49:48,173 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 3 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:48,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 690 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 458 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 08:49:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-08 08:49:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2022-04-08 08:49:48,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:48,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 532 states, 527 states have (on average 1.4838709677419355) internal successors, (782), 527 states have internal predecessors, (782), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:48,202 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 532 states, 527 states have (on average 1.4838709677419355) internal successors, (782), 527 states have internal predecessors, (782), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:48,203 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 532 states, 527 states have (on average 1.4838709677419355) internal successors, (782), 527 states have internal predecessors, (782), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:48,216 INFO L93 Difference]: Finished difference Result 532 states and 786 transitions. [2022-04-08 08:49:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 786 transitions. [2022-04-08 08:49:48,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:48,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:48,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 527 states have (on average 1.4838709677419355) internal successors, (782), 527 states have internal predecessors, (782), 3 states have call successors, (3), 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 532 states. [2022-04-08 08:49:48,219 INFO L87 Difference]: Start difference. First operand has 532 states, 527 states have (on average 1.4838709677419355) internal successors, (782), 527 states have internal predecessors, (782), 3 states have call successors, (3), 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 532 states. [2022-04-08 08:49:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:48,233 INFO L93 Difference]: Finished difference Result 532 states and 786 transitions. [2022-04-08 08:49:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 786 transitions. [2022-04-08 08:49:48,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:48,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:48,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:48,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 527 states have (on average 1.4838709677419355) internal successors, (782), 527 states have internal predecessors, (782), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 786 transitions. [2022-04-08 08:49:48,254 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 786 transitions. Word has length 83 [2022-04-08 08:49:48,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:48,254 INFO L478 AbstractCegarLoop]: Abstraction has 532 states and 786 transitions. [2022-04-08 08:49:48,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:48,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 532 states and 786 transitions. [2022-04-08 08:49:51,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 786 edges. 785 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 786 transitions. [2022-04-08 08:49:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 08:49:51,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:51,522 INFO L499 BasicCegarLoop]: trace histogram [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, 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-08 08:49:51,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:49:51,522 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1443200503, now seen corresponding path program 1 times [2022-04-08 08:49:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:51,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1137240328] [2022-04-08 08:49:51,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:51,564 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:51,564 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1443200503, now seen corresponding path program 2 times [2022-04-08 08:49:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:51,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632584770] [2022-04-08 08:49:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:51,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {52707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52700#true} is VALID [2022-04-08 08:49:51,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {52700#true} assume true; {52700#true} is VALID [2022-04-08 08:49:51,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52700#true} {52700#true} #708#return; {52700#true} is VALID [2022-04-08 08:49:51,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {52700#true} call ULTIMATE.init(); {52707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:49:51,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {52707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52700#true} is VALID [2022-04-08 08:49:51,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {52700#true} assume true; {52700#true} is VALID [2022-04-08 08:49:51,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52700#true} {52700#true} #708#return; {52700#true} is VALID [2022-04-08 08:49:51,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {52700#true} call #t~ret161 := main(); {52700#true} is VALID [2022-04-08 08:49:51,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {52700#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {52700#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L272 TraceCheckUtils]: 7: Hoare triple {52700#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {52700#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {52700#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {52700#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {52700#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {52700#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {52700#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {52700#true} assume !false; {52700#true} is VALID [2022-04-08 08:49:51,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {52700#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {52700#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {52700#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {52700#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {52700#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {52700#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {52700#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {52700#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {52700#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {52700#true} assume 8464 == #t~mem55;havoc #t~mem55; {52700#true} is VALID [2022-04-08 08:49:51,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {52700#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52700#true} is VALID [2022-04-08 08:49:51,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {52700#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52700#true} is VALID [2022-04-08 08:49:51,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {52700#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:51,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:51,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:51,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:51,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:51,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:51,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:51,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:49:51,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {52705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52706#(= |ssl3_accept_#t~mem50| 8496)} is VALID [2022-04-08 08:49:51,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {52706#(= |ssl3_accept_#t~mem50| 8496)} assume 24576 == #t~mem50;havoc #t~mem50; {52701#false} is VALID [2022-04-08 08:49:51,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {52701#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {52701#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52701#false} is VALID [2022-04-08 08:49:51,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {52701#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {52701#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {52701#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {52701#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {52701#false} assume 12292 != #t~mem85;havoc #t~mem85; {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {52701#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {52701#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {52701#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 47: Hoare triple {52701#false} ~skip~0 := 0; {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {52701#false} assume !false; {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {52701#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {52701#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {52701#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {52701#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {52701#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 54: Hoare triple {52701#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {52701#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {52701#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {52701#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {52701#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 59: Hoare triple {52701#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {52701#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,826 INFO L290 TraceCheckUtils]: 61: Hoare triple {52701#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {52701#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {52701#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 64: Hoare triple {52701#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {52701#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 66: Hoare triple {52701#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 67: Hoare triple {52701#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 68: Hoare triple {52701#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 69: Hoare triple {52701#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {52701#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {52701#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,827 INFO L290 TraceCheckUtils]: 72: Hoare triple {52701#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 73: Hoare triple {52701#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {52701#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {52701#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 76: Hoare triple {52701#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 77: Hoare triple {52701#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 78: Hoare triple {52701#false} assume 8640 == #t~mem75;havoc #t~mem75; {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 79: Hoare triple {52701#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 80: Hoare triple {52701#false} assume !(4 == ~blastFlag~0); {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {52701#false} assume !(7 == ~blastFlag~0); {52701#false} is VALID [2022-04-08 08:49:51,828 INFO L290 TraceCheckUtils]: 82: Hoare triple {52701#false} assume !(10 == ~blastFlag~0); {52701#false} is VALID [2022-04-08 08:49:51,829 INFO L290 TraceCheckUtils]: 83: Hoare triple {52701#false} assume 13 == ~blastFlag~0; {52701#false} is VALID [2022-04-08 08:49:51,829 INFO L290 TraceCheckUtils]: 84: Hoare triple {52701#false} assume !false; {52701#false} is VALID [2022-04-08 08:49:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:49:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:51,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632584770] [2022-04-08 08:49:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632584770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:51,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:51,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:51,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:51,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1137240328] [2022-04-08 08:49:51,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1137240328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:51,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:51,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880313049] [2022-04-08 08:49:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:51,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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 85 [2022-04-08 08:49:51,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:51,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:51,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:51,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:51,896 INFO L87 Difference]: Start difference. First operand 532 states and 786 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:53,979 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-08 08:49:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:59,390 INFO L93 Difference]: Finished difference Result 754 states and 1118 transitions. [2022-04-08 08:49:59,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:59,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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 85 [2022-04-08 08:49:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-08 08:49:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-08 08:49:59,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-04-08 08:49:59,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:59,738 INFO L225 Difference]: With dead ends: 754 [2022-04-08 08:49:59,738 INFO L226 Difference]: Without dead ends: 559 [2022-04-08 08:49:59,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:59,739 INFO L913 BasicCegarLoop]: 245 mSDtfsCounter, 36 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:59,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 611 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 438 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-08 08:49:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-08 08:49:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 532. [2022-04-08 08:49:59,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:59,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 532 states, 527 states have (on average 1.4819734345351043) internal successors, (781), 527 states have internal predecessors, (781), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:59,768 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 532 states, 527 states have (on average 1.4819734345351043) internal successors, (781), 527 states have internal predecessors, (781), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:59,768 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 532 states, 527 states have (on average 1.4819734345351043) internal successors, (781), 527 states have internal predecessors, (781), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:59,781 INFO L93 Difference]: Finished difference Result 559 states and 820 transitions. [2022-04-08 08:49:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 820 transitions. [2022-04-08 08:49:59,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:59,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:59,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 527 states have (on average 1.4819734345351043) internal successors, (781), 527 states have internal predecessors, (781), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 559 states. [2022-04-08 08:49:59,783 INFO L87 Difference]: Start difference. First operand has 532 states, 527 states have (on average 1.4819734345351043) internal successors, (781), 527 states have internal predecessors, (781), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 559 states. [2022-04-08 08:49:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:59,798 INFO L93 Difference]: Finished difference Result 559 states and 820 transitions. [2022-04-08 08:49:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 820 transitions. [2022-04-08 08:49:59,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:59,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:59,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:59,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 527 states have (on average 1.4819734345351043) internal successors, (781), 527 states have internal predecessors, (781), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 785 transitions. [2022-04-08 08:49:59,818 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 785 transitions. Word has length 85 [2022-04-08 08:49:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:59,819 INFO L478 AbstractCegarLoop]: Abstraction has 532 states and 785 transitions. [2022-04-08 08:49:59,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:59,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 532 states and 785 transitions. [2022-04-08 08:50:03,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 785 edges. 784 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 785 transitions. [2022-04-08 08:50:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 08:50:03,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:03,223 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:03,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:50:03,223 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1206059988, now seen corresponding path program 1 times [2022-04-08 08:50:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:03,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293087730] [2022-04-08 08:50:03,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:50:03,258 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:50:03,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:03,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1206059988, now seen corresponding path program 2 times [2022-04-08 08:50:03,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:03,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180670434] [2022-04-08 08:50:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:03,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:03,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {56409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56402#true} is VALID [2022-04-08 08:50:03,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {56402#true} assume true; {56402#true} is VALID [2022-04-08 08:50:03,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56402#true} {56402#true} #708#return; {56402#true} is VALID [2022-04-08 08:50:03,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {56402#true} call ULTIMATE.init(); {56409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:50:03,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {56409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {56402#true} assume true; {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56402#true} {56402#true} #708#return; {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {56402#true} call #t~ret161 := main(); {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {56402#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {56402#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L272 TraceCheckUtils]: 7: Hoare triple {56402#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {56402#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {56402#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {56402#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {56402#true} is VALID [2022-04-08 08:50:03,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {56402#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {56402#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {56402#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {56402#true} assume !false; {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {56402#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {56402#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {56402#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {56402#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {56402#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {56402#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {56402#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {56402#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {56402#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56402#true} is VALID [2022-04-08 08:50:03,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {56402#true} assume 8464 == #t~mem55;havoc #t~mem55; {56402#true} is VALID [2022-04-08 08:50:03,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {56402#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {56402#true} is VALID [2022-04-08 08:50:03,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {56402#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {56402#true} is VALID [2022-04-08 08:50:03,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {56402#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:03,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {56407#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56408#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-08 08:50:03,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {56408#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {56403#false} is VALID [2022-04-08 08:50:03,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {56403#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {56403#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {56403#false} is VALID [2022-04-08 08:50:03,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {56403#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {56403#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {56403#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {56403#false} is VALID [2022-04-08 08:50:03,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {56403#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {56403#false} assume 12292 != #t~mem85;havoc #t~mem85; {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {56403#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {56403#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {56403#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {56403#false} ~skip~0 := 0; {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {56403#false} assume !false; {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {56403#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {56403#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {56403#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {56403#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {56403#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {56403#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {56403#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {56403#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {56403#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {56403#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {56403#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {56403#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {56403#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {56403#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {56403#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {56403#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {56403#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {56403#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {56403#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {56403#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {56403#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {56403#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {56403#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {56403#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 74: Hoare triple {56403#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,509 INFO L290 TraceCheckUtils]: 75: Hoare triple {56403#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 76: Hoare triple {56403#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {56403#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {56403#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {56403#false} assume 8640 == #t~mem75;havoc #t~mem75; {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 80: Hoare triple {56403#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {56403#false} assume !(4 == ~blastFlag~0); {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {56403#false} assume !(7 == ~blastFlag~0); {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {56403#false} assume !(10 == ~blastFlag~0); {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 84: Hoare triple {56403#false} assume 13 == ~blastFlag~0; {56403#false} is VALID [2022-04-08 08:50:03,510 INFO L290 TraceCheckUtils]: 85: Hoare triple {56403#false} assume !false; {56403#false} is VALID [2022-04-08 08:50:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:50:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:03,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180670434] [2022-04-08 08:50:03,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180670434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:03,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:03,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:03,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:03,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293087730] [2022-04-08 08:50:03,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293087730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:03,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:03,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095763628] [2022-04-08 08:50:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:03,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-08 08:50:03,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:03,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:03,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:03,582 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:03,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:03,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:03,582 INFO L87 Difference]: Start difference. First operand 532 states and 785 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:05,667 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-08 08:50:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:10,883 INFO L93 Difference]: Finished difference Result 1212 states and 1798 transitions. [2022-04-08 08:50:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:50:10,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-08 08:50:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:50:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-04-08 08:50:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-04-08 08:50:10,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 612 transitions. [2022-04-08 08:50:11,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:11,375 INFO L225 Difference]: With dead ends: 1212 [2022-04-08 08:50:11,375 INFO L226 Difference]: Without dead ends: 838 [2022-04-08 08:50:11,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:50:11,376 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 148 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:50:11,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 366 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-08 08:50:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-04-08 08:50:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 532. [2022-04-08 08:50:11,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:50:11,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 838 states. Second operand has 532 states, 527 states have (on average 1.4686907020872866) internal successors, (774), 527 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:11,411 INFO L74 IsIncluded]: Start isIncluded. First operand 838 states. Second operand has 532 states, 527 states have (on average 1.4686907020872866) internal successors, (774), 527 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:11,411 INFO L87 Difference]: Start difference. First operand 838 states. Second operand has 532 states, 527 states have (on average 1.4686907020872866) internal successors, (774), 527 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:11,443 INFO L93 Difference]: Finished difference Result 838 states and 1235 transitions. [2022-04-08 08:50:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1235 transitions. [2022-04-08 08:50:11,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:11,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:11,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 527 states have (on average 1.4686907020872866) internal successors, (774), 527 states have internal predecessors, (774), 3 states have call successors, (3), 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 838 states. [2022-04-08 08:50:11,446 INFO L87 Difference]: Start difference. First operand has 532 states, 527 states have (on average 1.4686907020872866) internal successors, (774), 527 states have internal predecessors, (774), 3 states have call successors, (3), 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 838 states. [2022-04-08 08:50:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:11,480 INFO L93 Difference]: Finished difference Result 838 states and 1235 transitions. [2022-04-08 08:50:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1235 transitions. [2022-04-08 08:50:11,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:11,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:11,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:50:11,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:50:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 527 states have (on average 1.4686907020872866) internal successors, (774), 527 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 778 transitions. [2022-04-08 08:50:11,500 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 778 transitions. Word has length 86 [2022-04-08 08:50:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:50:11,500 INFO L478 AbstractCegarLoop]: Abstraction has 532 states and 778 transitions. [2022-04-08 08:50:11,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:11,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 532 states and 778 transitions. [2022-04-08 08:50:14,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 777 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 778 transitions. [2022-04-08 08:50:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 08:50:14,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:14,704 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:14,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:50:14,704 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:14,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1811938044, now seen corresponding path program 1 times [2022-04-08 08:50:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:14,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590095567] [2022-04-08 08:50:14,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:50:14,746 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:50:14,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1811938044, now seen corresponding path program 2 times [2022-04-08 08:50:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:14,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941373534] [2022-04-08 08:50:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:14,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:15,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {61585#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {61578#true} is VALID [2022-04-08 08:50:15,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {61578#true} assume true; {61578#true} is VALID [2022-04-08 08:50:15,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61578#true} {61578#true} #708#return; {61578#true} is VALID [2022-04-08 08:50:15,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {61578#true} call ULTIMATE.init(); {61585#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:50:15,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {61585#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {61578#true} is VALID [2022-04-08 08:50:15,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {61578#true} assume true; {61578#true} is VALID [2022-04-08 08:50:15,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61578#true} {61578#true} #708#return; {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {61578#true} call #t~ret161 := main(); {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {61578#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {61578#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L272 TraceCheckUtils]: 7: Hoare triple {61578#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {61578#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {61578#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {61578#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {61578#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {61578#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {61578#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {61578#true} assume !false; {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {61578#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {61578#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {61578#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {61578#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {61578#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {61578#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {61578#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {61578#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {61578#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {61578#true} assume 8464 == #t~mem55;havoc #t~mem55; {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {61578#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {61578#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {61578#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {61578#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {61578#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {61578#true} ~skip~0 := 0; {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {61578#true} assume !false; {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {61578#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {61578#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {61578#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {61578#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {61578#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {61578#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {61578#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {61578#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {61578#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {61578#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {61578#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {61578#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {61578#true} assume 8496 == #t~mem58;havoc #t~mem58; {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {61578#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {61578#true} is VALID [2022-04-08 08:50:15,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {61578#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61578#true} is VALID [2022-04-08 08:50:15,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {61578#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {61578#true} is VALID [2022-04-08 08:50:15,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {61578#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,011 INFO L290 TraceCheckUtils]: 55: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,013 INFO L290 TraceCheckUtils]: 59: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,015 INFO L290 TraceCheckUtils]: 63: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,015 INFO L290 TraceCheckUtils]: 64: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,017 INFO L290 TraceCheckUtils]: 69: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,018 INFO L290 TraceCheckUtils]: 71: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,019 INFO L290 TraceCheckUtils]: 72: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,020 INFO L290 TraceCheckUtils]: 74: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,020 INFO L290 TraceCheckUtils]: 75: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,021 INFO L290 TraceCheckUtils]: 76: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,021 INFO L290 TraceCheckUtils]: 77: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,021 INFO L290 TraceCheckUtils]: 78: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,022 INFO L290 TraceCheckUtils]: 79: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,022 INFO L290 TraceCheckUtils]: 80: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,023 INFO L290 TraceCheckUtils]: 81: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:15,023 INFO L290 TraceCheckUtils]: 82: Hoare triple {61583#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {61584#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:50:15,024 INFO L290 TraceCheckUtils]: 83: Hoare triple {61584#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {61579#false} is VALID [2022-04-08 08:50:15,024 INFO L290 TraceCheckUtils]: 84: Hoare triple {61579#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {61579#false} is VALID [2022-04-08 08:50:15,024 INFO L290 TraceCheckUtils]: 85: Hoare triple {61579#false} assume !(4 == ~blastFlag~0); {61579#false} is VALID [2022-04-08 08:50:15,024 INFO L290 TraceCheckUtils]: 86: Hoare triple {61579#false} assume !(7 == ~blastFlag~0); {61579#false} is VALID [2022-04-08 08:50:15,024 INFO L290 TraceCheckUtils]: 87: Hoare triple {61579#false} assume !(10 == ~blastFlag~0); {61579#false} is VALID [2022-04-08 08:50:15,024 INFO L290 TraceCheckUtils]: 88: Hoare triple {61579#false} assume 13 == ~blastFlag~0; {61579#false} is VALID [2022-04-08 08:50:15,024 INFO L290 TraceCheckUtils]: 89: Hoare triple {61579#false} assume !false; {61579#false} is VALID [2022-04-08 08:50:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:50:15,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:15,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941373534] [2022-04-08 08:50:15,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941373534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:15,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:15,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:15,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:15,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590095567] [2022-04-08 08:50:15,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590095567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:15,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:15,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:15,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922791202] [2022-04-08 08:50:15,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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 90 [2022-04-08 08:50:15,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:15,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:50:15,097 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-08 08:50:15,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:15,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:15,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:15,098 INFO L87 Difference]: Start difference. First operand 532 states and 778 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:50:17,182 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-08 08:50:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:22,595 INFO L93 Difference]: Finished difference Result 1398 states and 2057 transitions. [2022-04-08 08:50:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:50:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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 90 [2022-04-08 08:50:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:50:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:50:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-04-08 08:50:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:50:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-04-08 08:50:22,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 612 transitions. [2022-04-08 08:50:23,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:23,081 INFO L225 Difference]: With dead ends: 1398 [2022-04-08 08:50:23,081 INFO L226 Difference]: Without dead ends: 892 [2022-04-08 08:50:23,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:50:23,083 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 123 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:50:23,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 368 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 485 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-08 08:50:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-04-08 08:50:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 652. [2022-04-08 08:50:23,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:50:23,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 892 states. Second operand has 652 states, 647 states have (on average 1.5115919629057186) internal successors, (978), 647 states have internal predecessors, (978), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:23,135 INFO L74 IsIncluded]: Start isIncluded. First operand 892 states. Second operand has 652 states, 647 states have (on average 1.5115919629057186) internal successors, (978), 647 states have internal predecessors, (978), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:23,135 INFO L87 Difference]: Start difference. First operand 892 states. Second operand has 652 states, 647 states have (on average 1.5115919629057186) internal successors, (978), 647 states have internal predecessors, (978), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:23,171 INFO L93 Difference]: Finished difference Result 892 states and 1307 transitions. [2022-04-08 08:50:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1307 transitions. [2022-04-08 08:50:23,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:23,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:23,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 652 states, 647 states have (on average 1.5115919629057186) internal successors, (978), 647 states have internal predecessors, (978), 3 states have call successors, (3), 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 892 states. [2022-04-08 08:50:23,175 INFO L87 Difference]: Start difference. First operand has 652 states, 647 states have (on average 1.5115919629057186) internal successors, (978), 647 states have internal predecessors, (978), 3 states have call successors, (3), 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 892 states. [2022-04-08 08:50:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:23,209 INFO L93 Difference]: Finished difference Result 892 states and 1307 transitions. [2022-04-08 08:50:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1307 transitions. [2022-04-08 08:50:23,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:23,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:23,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:50:23,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:50:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 647 states have (on average 1.5115919629057186) internal successors, (978), 647 states have internal predecessors, (978), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 982 transitions. [2022-04-08 08:50:23,238 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 982 transitions. Word has length 90 [2022-04-08 08:50:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:50:23,238 INFO L478 AbstractCegarLoop]: Abstraction has 652 states and 982 transitions. [2022-04-08 08:50:23,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 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-08 08:50:23,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 652 states and 982 transitions. [2022-04-08 08:50:26,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 982 edges. 981 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 982 transitions. [2022-04-08 08:50:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 08:50:26,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:26,501 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:26,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:50:26,501 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash -14689004, now seen corresponding path program 1 times [2022-04-08 08:50:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:26,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2131442380] [2022-04-08 08:50:26,537 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:50:26,537 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:50:26,537 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:26,537 INFO L85 PathProgramCache]: Analyzing trace with hash -14689004, now seen corresponding path program 2 times [2022-04-08 08:50:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:26,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038931172] [2022-04-08 08:50:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:26,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:26,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {67481#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {67474#true} is VALID [2022-04-08 08:50:26,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {67474#true} assume true; {67474#true} is VALID [2022-04-08 08:50:26,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67474#true} {67474#true} #708#return; {67474#true} is VALID [2022-04-08 08:50:26,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {67474#true} call ULTIMATE.init(); {67481#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:50:26,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {67481#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {67474#true} is VALID [2022-04-08 08:50:26,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {67474#true} assume true; {67474#true} is VALID [2022-04-08 08:50:26,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67474#true} {67474#true} #708#return; {67474#true} is VALID [2022-04-08 08:50:26,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {67474#true} call #t~ret161 := main(); {67474#true} is VALID [2022-04-08 08:50:26,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {67474#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {67474#true} is VALID [2022-04-08 08:50:26,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {67474#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,776 INFO L272 TraceCheckUtils]: 7: Hoare triple {67474#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {67474#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {67474#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {67474#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {67474#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {67474#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {67474#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {67474#true} assume !false; {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {67474#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {67474#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {67474#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {67474#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {67474#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {67474#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {67474#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {67474#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {67474#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {67474#true} assume 8464 == #t~mem55;havoc #t~mem55; {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {67474#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {67474#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {67474#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {67474#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {67474#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67474#true} is VALID [2022-04-08 08:50:26,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {67474#true} ~skip~0 := 0; {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {67474#true} assume !false; {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {67474#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {67474#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {67474#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {67474#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {67474#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {67474#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {67474#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {67474#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {67474#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {67474#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {67474#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {67474#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {67474#true} assume 8496 == #t~mem58;havoc #t~mem58; {67474#true} is VALID [2022-04-08 08:50:26,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {67474#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {67474#true} is VALID [2022-04-08 08:50:26,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {67474#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {67474#true} is VALID [2022-04-08 08:50:26,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {67474#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {67474#true} is VALID [2022-04-08 08:50:26,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {67474#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,791 INFO L290 TraceCheckUtils]: 60: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,792 INFO L290 TraceCheckUtils]: 62: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,792 INFO L290 TraceCheckUtils]: 63: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,793 INFO L290 TraceCheckUtils]: 65: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,794 INFO L290 TraceCheckUtils]: 67: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,794 INFO L290 TraceCheckUtils]: 68: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,794 INFO L290 TraceCheckUtils]: 69: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,795 INFO L290 TraceCheckUtils]: 70: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,795 INFO L290 TraceCheckUtils]: 71: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,796 INFO L290 TraceCheckUtils]: 73: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,796 INFO L290 TraceCheckUtils]: 74: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,797 INFO L290 TraceCheckUtils]: 75: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,798 INFO L290 TraceCheckUtils]: 78: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,798 INFO L290 TraceCheckUtils]: 79: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:26,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {67479#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {67480#(= |ssl3_accept_#t~mem76| 8656)} is VALID [2022-04-08 08:50:26,800 INFO L290 TraceCheckUtils]: 84: Hoare triple {67480#(= |ssl3_accept_#t~mem76| 8656)} assume 8641 == #t~mem76;havoc #t~mem76; {67475#false} is VALID [2022-04-08 08:50:26,800 INFO L290 TraceCheckUtils]: 85: Hoare triple {67475#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {67475#false} is VALID [2022-04-08 08:50:26,800 INFO L290 TraceCheckUtils]: 86: Hoare triple {67475#false} assume !(4 == ~blastFlag~0); {67475#false} is VALID [2022-04-08 08:50:26,800 INFO L290 TraceCheckUtils]: 87: Hoare triple {67475#false} assume !(7 == ~blastFlag~0); {67475#false} is VALID [2022-04-08 08:50:26,800 INFO L290 TraceCheckUtils]: 88: Hoare triple {67475#false} assume !(10 == ~blastFlag~0); {67475#false} is VALID [2022-04-08 08:50:26,800 INFO L290 TraceCheckUtils]: 89: Hoare triple {67475#false} assume 13 == ~blastFlag~0; {67475#false} is VALID [2022-04-08 08:50:26,800 INFO L290 TraceCheckUtils]: 90: Hoare triple {67475#false} assume !false; {67475#false} is VALID [2022-04-08 08:50:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:50:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:26,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038931172] [2022-04-08 08:50:26,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038931172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:26,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:26,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:26,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:26,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2131442380] [2022-04-08 08:50:26,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2131442380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:26,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:26,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:26,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68955803] [2022-04-08 08:50:26,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:26,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-08 08:50:26,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:26,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:26,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:26,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:26,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:26,862 INFO L87 Difference]: Start difference. First operand 652 states and 982 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:28,948 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-08 08:50:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:36,637 INFO L93 Difference]: Finished difference Result 1578 states and 2375 transitions. [2022-04-08 08:50:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:50:36,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-08 08:50:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:50:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:50:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:50:36,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-08 08:50:37,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:37,089 INFO L225 Difference]: With dead ends: 1578 [2022-04-08 08:50:37,090 INFO L226 Difference]: Without dead ends: 952 [2022-04-08 08:50:37,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:50:37,091 INFO L913 BasicCegarLoop]: 286 mSDtfsCounter, 83 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:50:37,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 693 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 641 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 08:50:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-04-08 08:50:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 778. [2022-04-08 08:50:37,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:50:37,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 952 states. Second operand has 778 states, 773 states have (on average 1.536869340232859) internal successors, (1188), 773 states have internal predecessors, (1188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:37,143 INFO L74 IsIncluded]: Start isIncluded. First operand 952 states. Second operand has 778 states, 773 states have (on average 1.536869340232859) internal successors, (1188), 773 states have internal predecessors, (1188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:37,144 INFO L87 Difference]: Start difference. First operand 952 states. Second operand has 778 states, 773 states have (on average 1.536869340232859) internal successors, (1188), 773 states have internal predecessors, (1188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:37,170 INFO L93 Difference]: Finished difference Result 952 states and 1421 transitions. [2022-04-08 08:50:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1421 transitions. [2022-04-08 08:50:37,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:37,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:37,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 778 states, 773 states have (on average 1.536869340232859) internal successors, (1188), 773 states have internal predecessors, (1188), 3 states have call successors, (3), 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 952 states. [2022-04-08 08:50:37,173 INFO L87 Difference]: Start difference. First operand has 778 states, 773 states have (on average 1.536869340232859) internal successors, (1188), 773 states have internal predecessors, (1188), 3 states have call successors, (3), 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 952 states. [2022-04-08 08:50:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:37,200 INFO L93 Difference]: Finished difference Result 952 states and 1421 transitions. [2022-04-08 08:50:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1421 transitions. [2022-04-08 08:50:37,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:37,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:37,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:50:37,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:50:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 773 states have (on average 1.536869340232859) internal successors, (1188), 773 states have internal predecessors, (1188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1192 transitions. [2022-04-08 08:50:37,242 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1192 transitions. Word has length 91 [2022-04-08 08:50:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:50:37,243 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 1192 transitions. [2022-04-08 08:50:37,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:37,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 778 states and 1192 transitions. [2022-04-08 08:50:40,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1192 edges. 1191 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1192 transitions. [2022-04-08 08:50:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 08:50:40,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:40,654 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:40,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:50:40,654 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:40,655 INFO L85 PathProgramCache]: Analyzing trace with hash -912082282, now seen corresponding path program 1 times [2022-04-08 08:50:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:40,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275584828] [2022-04-08 08:50:40,685 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:50:40,686 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:50:40,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash -912082282, now seen corresponding path program 2 times [2022-04-08 08:50:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:40,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371597508] [2022-04-08 08:50:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:40,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:40,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {74109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74102#true} is VALID [2022-04-08 08:50:40,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {74102#true} assume true; {74102#true} is VALID [2022-04-08 08:50:40,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74102#true} {74102#true} #708#return; {74102#true} is VALID [2022-04-08 08:50:40,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {74102#true} call ULTIMATE.init(); {74109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:50:40,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {74109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74102#true} is VALID [2022-04-08 08:50:40,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {74102#true} assume true; {74102#true} is VALID [2022-04-08 08:50:40,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74102#true} {74102#true} #708#return; {74102#true} is VALID [2022-04-08 08:50:40,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {74102#true} call #t~ret161 := main(); {74102#true} is VALID [2022-04-08 08:50:40,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {74102#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {74102#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L272 TraceCheckUtils]: 7: Hoare triple {74102#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {74102#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {74102#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {74102#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {74102#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {74102#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {74102#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {74102#true} is VALID [2022-04-08 08:50:40,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {74102#true} assume !false; {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {74102#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {74102#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {74102#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {74102#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {74102#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {74102#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {74102#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {74102#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {74102#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {74102#true} assume 8464 == #t~mem55;havoc #t~mem55; {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {74102#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {74102#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {74102#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {74102#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {74102#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {74102#true} ~skip~0 := 0; {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {74102#true} assume !false; {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {74102#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {74102#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {74102#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {74102#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {74102#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {74102#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {74102#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {74102#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {74102#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {74102#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {74102#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {74102#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {74102#true} assume 8496 == #t~mem58;havoc #t~mem58; {74102#true} is VALID [2022-04-08 08:50:40,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {74102#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {74102#true} is VALID [2022-04-08 08:50:40,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {74102#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {74102#true} is VALID [2022-04-08 08:50:40,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {74102#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {74102#true} is VALID [2022-04-08 08:50:40,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {74102#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,956 INFO L290 TraceCheckUtils]: 55: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,959 INFO L290 TraceCheckUtils]: 61: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,959 INFO L290 TraceCheckUtils]: 62: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,962 INFO L290 TraceCheckUtils]: 67: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,962 INFO L290 TraceCheckUtils]: 68: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,963 INFO L290 TraceCheckUtils]: 69: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,963 INFO L290 TraceCheckUtils]: 70: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,964 INFO L290 TraceCheckUtils]: 71: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,964 INFO L290 TraceCheckUtils]: 72: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,965 INFO L290 TraceCheckUtils]: 73: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,966 INFO L290 TraceCheckUtils]: 75: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,966 INFO L290 TraceCheckUtils]: 76: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,968 INFO L290 TraceCheckUtils]: 79: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,968 INFO L290 TraceCheckUtils]: 80: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,968 INFO L290 TraceCheckUtils]: 81: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,969 INFO L290 TraceCheckUtils]: 82: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:40,969 INFO L290 TraceCheckUtils]: 83: Hoare triple {74107#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {74108#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 08:50:40,970 INFO L290 TraceCheckUtils]: 84: Hoare triple {74108#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {74103#false} is VALID [2022-04-08 08:50:40,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {74103#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {74103#false} is VALID [2022-04-08 08:50:40,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {74103#false} assume !(4 == ~blastFlag~0); {74103#false} is VALID [2022-04-08 08:50:40,970 INFO L290 TraceCheckUtils]: 87: Hoare triple {74103#false} assume !(7 == ~blastFlag~0); {74103#false} is VALID [2022-04-08 08:50:40,970 INFO L290 TraceCheckUtils]: 88: Hoare triple {74103#false} assume !(10 == ~blastFlag~0); {74103#false} is VALID [2022-04-08 08:50:40,970 INFO L290 TraceCheckUtils]: 89: Hoare triple {74103#false} assume 13 == ~blastFlag~0; {74103#false} is VALID [2022-04-08 08:50:40,970 INFO L290 TraceCheckUtils]: 90: Hoare triple {74103#false} assume !false; {74103#false} is VALID [2022-04-08 08:50:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:50:40,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:40,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371597508] [2022-04-08 08:50:40,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371597508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:40,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:40,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:40,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:40,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275584828] [2022-04-08 08:50:40,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275584828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:40,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:40,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:40,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333192031] [2022-04-08 08:50:40,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:40,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-08 08:50:40,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:40,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:41,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:41,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:41,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:41,047 INFO L87 Difference]: Start difference. First operand 778 states and 1192 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:44,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:47,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:58,323 INFO L93 Difference]: Finished difference Result 1836 states and 2810 transitions. [2022-04-08 08:50:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:50:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-08 08:50:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:50:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-08 08:50:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-08 08:50:58,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 611 transitions. [2022-04-08 08:50:58,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:58,815 INFO L225 Difference]: With dead ends: 1836 [2022-04-08 08:50:58,815 INFO L226 Difference]: Without dead ends: 1084 [2022-04-08 08:50:58,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:50:58,817 INFO L913 BasicCegarLoop]: 139 mSDtfsCounter, 122 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:50:58,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 394 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-08 08:50:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-04-08 08:50:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 721. [2022-04-08 08:50:58,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:50:58,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1084 states. Second operand has 721 states, 716 states have (on average 1.5544692737430168) internal successors, (1113), 716 states have internal predecessors, (1113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:58,881 INFO L74 IsIncluded]: Start isIncluded. First operand 1084 states. Second operand has 721 states, 716 states have (on average 1.5544692737430168) internal successors, (1113), 716 states have internal predecessors, (1113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:58,882 INFO L87 Difference]: Start difference. First operand 1084 states. Second operand has 721 states, 716 states have (on average 1.5544692737430168) internal successors, (1113), 716 states have internal predecessors, (1113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:58,915 INFO L93 Difference]: Finished difference Result 1084 states and 1646 transitions. [2022-04-08 08:50:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1646 transitions. [2022-04-08 08:50:58,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:58,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:58,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.5544692737430168) internal successors, (1113), 716 states have internal predecessors, (1113), 3 states have call successors, (3), 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 1084 states. [2022-04-08 08:50:58,917 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.5544692737430168) internal successors, (1113), 716 states have internal predecessors, (1113), 3 states have call successors, (3), 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 1084 states. [2022-04-08 08:50:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:58,966 INFO L93 Difference]: Finished difference Result 1084 states and 1646 transitions. [2022-04-08 08:50:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1646 transitions. [2022-04-08 08:50:58,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:58,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:58,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:50:58,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:50:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.5544692737430168) internal successors, (1113), 716 states have internal predecessors, (1113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1117 transitions. [2022-04-08 08:50:58,987 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1117 transitions. Word has length 91 [2022-04-08 08:50:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:50:58,987 INFO L478 AbstractCegarLoop]: Abstraction has 721 states and 1117 transitions. [2022-04-08 08:50:58,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:58,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 721 states and 1117 transitions. [2022-04-08 08:51:02,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1117 edges. 1116 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1117 transitions. [2022-04-08 08:51:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 08:51:02,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:51:02,512 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:51:02,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:51:02,512 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:51:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:51:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash 393910684, now seen corresponding path program 1 times [2022-04-08 08:51:02,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:02,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917481575] [2022-04-08 08:51:02,567 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:51:02,567 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:51:02,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:51:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 393910684, now seen corresponding path program 2 times [2022-04-08 08:51:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:51:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056821033] [2022-04-08 08:51:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:51:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:51:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:51:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:02,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {81403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {81396#true} is VALID [2022-04-08 08:51:02,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {81396#true} assume true; {81396#true} is VALID [2022-04-08 08:51:02,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81396#true} {81396#true} #708#return; {81396#true} is VALID [2022-04-08 08:51:02,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {81396#true} call ULTIMATE.init(); {81403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:51:02,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {81403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {81396#true} is VALID [2022-04-08 08:51:02,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {81396#true} assume true; {81396#true} is VALID [2022-04-08 08:51:02,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81396#true} {81396#true} #708#return; {81396#true} is VALID [2022-04-08 08:51:02,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {81396#true} call #t~ret161 := main(); {81396#true} is VALID [2022-04-08 08:51:02,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {81396#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {81396#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L272 TraceCheckUtils]: 7: Hoare triple {81396#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {81396#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {81396#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {81396#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {81396#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {81396#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {81396#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {81396#true} assume !false; {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {81396#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {81396#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {81396#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {81396#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {81396#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {81396#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {81396#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {81396#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {81396#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {81396#true} assume 8464 == #t~mem55;havoc #t~mem55; {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {81396#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {81396#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {81396#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {81396#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {81396#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {81396#true} ~skip~0 := 0; {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {81396#true} assume !false; {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {81396#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {81396#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {81396#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {81396#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {81396#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {81396#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {81396#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {81396#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {81396#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {81396#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {81396#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {81396#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {81396#true} assume 8496 == #t~mem58;havoc #t~mem58; {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {81396#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {81396#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {81396#true} is VALID [2022-04-08 08:51:02,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {81396#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {81396#true} is VALID [2022-04-08 08:51:02,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {81396#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,841 INFO L290 TraceCheckUtils]: 55: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,843 INFO L290 TraceCheckUtils]: 61: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,846 INFO L290 TraceCheckUtils]: 67: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,846 INFO L290 TraceCheckUtils]: 68: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,847 INFO L290 TraceCheckUtils]: 69: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,847 INFO L290 TraceCheckUtils]: 70: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,848 INFO L290 TraceCheckUtils]: 71: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,849 INFO L290 TraceCheckUtils]: 73: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,849 INFO L290 TraceCheckUtils]: 74: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:51:02,850 INFO L290 TraceCheckUtils]: 75: Hoare triple {81401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {81402#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-08 08:51:02,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {81402#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {81397#false} is VALID [2022-04-08 08:51:02,850 INFO L290 TraceCheckUtils]: 77: Hoare triple {81397#false} assume !(~num1~0 > 0); {81397#false} is VALID [2022-04-08 08:51:02,850 INFO L290 TraceCheckUtils]: 78: Hoare triple {81397#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {81397#false} is VALID [2022-04-08 08:51:02,850 INFO L290 TraceCheckUtils]: 79: Hoare triple {81397#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 80: Hoare triple {81397#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 81: Hoare triple {81397#false} ~skip~0 := 0; {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 82: Hoare triple {81397#false} assume !false; {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 83: Hoare triple {81397#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 84: Hoare triple {81397#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 85: Hoare triple {81397#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {81397#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 87: Hoare triple {81397#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 88: Hoare triple {81397#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 89: Hoare triple {81397#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,851 INFO L290 TraceCheckUtils]: 90: Hoare triple {81397#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 91: Hoare triple {81397#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 92: Hoare triple {81397#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 93: Hoare triple {81397#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 94: Hoare triple {81397#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 95: Hoare triple {81397#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 96: Hoare triple {81397#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 97: Hoare triple {81397#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 98: Hoare triple {81397#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 99: Hoare triple {81397#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,852 INFO L290 TraceCheckUtils]: 100: Hoare triple {81397#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 101: Hoare triple {81397#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 102: Hoare triple {81397#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 103: Hoare triple {81397#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 104: Hoare triple {81397#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 105: Hoare triple {81397#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 106: Hoare triple {81397#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 107: Hoare triple {81397#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 108: Hoare triple {81397#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 109: Hoare triple {81397#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 110: Hoare triple {81397#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,853 INFO L290 TraceCheckUtils]: 111: Hoare triple {81397#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {81397#false} is VALID [2022-04-08 08:51:02,854 INFO L290 TraceCheckUtils]: 112: Hoare triple {81397#false} assume 8640 == #t~mem75;havoc #t~mem75; {81397#false} is VALID [2022-04-08 08:51:02,854 INFO L290 TraceCheckUtils]: 113: Hoare triple {81397#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {81397#false} is VALID [2022-04-08 08:51:02,854 INFO L290 TraceCheckUtils]: 114: Hoare triple {81397#false} assume !(4 == ~blastFlag~0); {81397#false} is VALID [2022-04-08 08:51:02,854 INFO L290 TraceCheckUtils]: 115: Hoare triple {81397#false} assume !(7 == ~blastFlag~0); {81397#false} is VALID [2022-04-08 08:51:02,854 INFO L290 TraceCheckUtils]: 116: Hoare triple {81397#false} assume !(10 == ~blastFlag~0); {81397#false} is VALID [2022-04-08 08:51:02,854 INFO L290 TraceCheckUtils]: 117: Hoare triple {81397#false} assume 13 == ~blastFlag~0; {81397#false} is VALID [2022-04-08 08:51:02,854 INFO L290 TraceCheckUtils]: 118: Hoare triple {81397#false} assume !false; {81397#false} is VALID [2022-04-08 08:51:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:51:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:51:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056821033] [2022-04-08 08:51:02,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056821033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:02,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:02,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:02,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:51:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917481575] [2022-04-08 08:51:02,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917481575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:02,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:02,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:02,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081640261] [2022-04-08 08:51:02,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:51:02,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-08 08:51:02,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:51:02,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:02,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:02,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:51:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:02,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:51:02,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:51:02,942 INFO L87 Difference]: Start difference. First operand 721 states and 1117 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:05,029 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-08 08:51:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:12,588 INFO L93 Difference]: Finished difference Result 1707 states and 2630 transitions. [2022-04-08 08:51:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:51:12,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-08 08:51:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:51:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 08:51:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 08:51:12,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-08 08:51:12,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:13,016 INFO L225 Difference]: With dead ends: 1707 [2022-04-08 08:51:13,017 INFO L226 Difference]: Without dead ends: 1012 [2022-04-08 08:51:13,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:51:13,018 INFO L913 BasicCegarLoop]: 284 mSDtfsCounter, 89 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:51:13,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 689 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 629 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 08:51:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2022-04-08 08:51:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 823. [2022-04-08 08:51:13,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:51:13,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1012 states. Second operand has 823 states, 818 states have (on average 1.5623471882640587) internal successors, (1278), 818 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:13,061 INFO L74 IsIncluded]: Start isIncluded. First operand 1012 states. Second operand has 823 states, 818 states have (on average 1.5623471882640587) internal successors, (1278), 818 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:13,061 INFO L87 Difference]: Start difference. First operand 1012 states. Second operand has 823 states, 818 states have (on average 1.5623471882640587) internal successors, (1278), 818 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:13,093 INFO L93 Difference]: Finished difference Result 1012 states and 1541 transitions. [2022-04-08 08:51:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1541 transitions. [2022-04-08 08:51:13,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:13,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:13,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 823 states, 818 states have (on average 1.5623471882640587) internal successors, (1278), 818 states have internal predecessors, (1278), 3 states have call successors, (3), 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 1012 states. [2022-04-08 08:51:13,096 INFO L87 Difference]: Start difference. First operand has 823 states, 818 states have (on average 1.5623471882640587) internal successors, (1278), 818 states have internal predecessors, (1278), 3 states have call successors, (3), 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 1012 states. [2022-04-08 08:51:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:13,128 INFO L93 Difference]: Finished difference Result 1012 states and 1541 transitions. [2022-04-08 08:51:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1541 transitions. [2022-04-08 08:51:13,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:13,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:13,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:51:13,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:51:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 818 states have (on average 1.5623471882640587) internal successors, (1278), 818 states have internal predecessors, (1278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1282 transitions. [2022-04-08 08:51:13,167 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1282 transitions. Word has length 119 [2022-04-08 08:51:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:51:13,168 INFO L478 AbstractCegarLoop]: Abstraction has 823 states and 1282 transitions. [2022-04-08 08:51:13,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:13,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 823 states and 1282 transitions. [2022-04-08 08:51:16,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1282 edges. 1281 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1282 transitions. [2022-04-08 08:51:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 08:51:16,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:51:16,718 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:51:16,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:51:16,719 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:51:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:51:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash -573439970, now seen corresponding path program 1 times [2022-04-08 08:51:16,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:16,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777871176] [2022-04-08 08:51:16,787 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:51:16,787 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:51:16,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:51:16,787 INFO L85 PathProgramCache]: Analyzing trace with hash -573439970, now seen corresponding path program 2 times [2022-04-08 08:51:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:51:16,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404853879] [2022-04-08 08:51:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:51:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:51:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:51:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:17,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {88499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88492#true} is VALID [2022-04-08 08:51:17,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {88492#true} assume true; {88492#true} is VALID [2022-04-08 08:51:17,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88492#true} {88492#true} #708#return; {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {88492#true} call ULTIMATE.init(); {88499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:51:17,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {88499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {88492#true} assume true; {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88492#true} {88492#true} #708#return; {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {88492#true} call #t~ret161 := main(); {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {88492#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {88492#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L272 TraceCheckUtils]: 7: Hoare triple {88492#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {88492#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {88492#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {88492#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {88492#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {88492#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {88492#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {88492#true} assume !false; {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {88492#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {88492#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {88492#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {88492#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {88492#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {88492#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {88492#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {88492#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {88492#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {88492#true} assume 8464 == #t~mem55;havoc #t~mem55; {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {88492#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {88492#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {88492#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {88492#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {88492#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88492#true} is VALID [2022-04-08 08:51:17,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {88492#true} ~skip~0 := 0; {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {88492#true} assume !false; {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {88492#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {88492#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {88492#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {88492#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {88492#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {88492#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {88492#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {88492#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {88492#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {88492#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {88492#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {88492#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {88492#true} assume 8496 == #t~mem58;havoc #t~mem58; {88492#true} is VALID [2022-04-08 08:51:17,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {88492#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88492#true} is VALID [2022-04-08 08:51:17,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {88492#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {88492#true} is VALID [2022-04-08 08:51:17,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {88492#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {88492#true} is VALID [2022-04-08 08:51:17,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {88492#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,070 INFO L290 TraceCheckUtils]: 58: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,072 INFO L290 TraceCheckUtils]: 63: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,075 INFO L290 TraceCheckUtils]: 69: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,075 INFO L290 TraceCheckUtils]: 70: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,076 INFO L290 TraceCheckUtils]: 71: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,076 INFO L290 TraceCheckUtils]: 72: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,077 INFO L290 TraceCheckUtils]: 74: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:17,077 INFO L290 TraceCheckUtils]: 75: Hoare triple {88497#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {88498#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 08:51:17,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {88498#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {88493#false} is VALID [2022-04-08 08:51:17,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {88493#false} assume !(~num1~0 > 0); {88493#false} is VALID [2022-04-08 08:51:17,078 INFO L290 TraceCheckUtils]: 78: Hoare triple {88493#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {88493#false} is VALID [2022-04-08 08:51:17,078 INFO L290 TraceCheckUtils]: 79: Hoare triple {88493#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,078 INFO L290 TraceCheckUtils]: 80: Hoare triple {88493#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88493#false} is VALID [2022-04-08 08:51:17,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {88493#false} ~skip~0 := 0; {88493#false} is VALID [2022-04-08 08:51:17,078 INFO L290 TraceCheckUtils]: 82: Hoare triple {88493#false} assume !false; {88493#false} is VALID [2022-04-08 08:51:17,078 INFO L290 TraceCheckUtils]: 83: Hoare triple {88493#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {88493#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 85: Hoare triple {88493#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 86: Hoare triple {88493#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {88493#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {88493#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {88493#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {88493#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {88493#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {88493#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {88493#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {88493#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {88493#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 96: Hoare triple {88493#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 97: Hoare triple {88493#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 98: Hoare triple {88493#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 99: Hoare triple {88493#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {88493#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {88493#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 102: Hoare triple {88493#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,080 INFO L290 TraceCheckUtils]: 103: Hoare triple {88493#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 104: Hoare triple {88493#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {88493#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 106: Hoare triple {88493#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 107: Hoare triple {88493#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 108: Hoare triple {88493#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 109: Hoare triple {88493#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 110: Hoare triple {88493#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 111: Hoare triple {88493#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 112: Hoare triple {88493#false} assume 8640 == #t~mem75;havoc #t~mem75; {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 113: Hoare triple {88493#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {88493#false} is VALID [2022-04-08 08:51:17,081 INFO L290 TraceCheckUtils]: 114: Hoare triple {88493#false} assume !(4 == ~blastFlag~0); {88493#false} is VALID [2022-04-08 08:51:17,082 INFO L290 TraceCheckUtils]: 115: Hoare triple {88493#false} assume !(7 == ~blastFlag~0); {88493#false} is VALID [2022-04-08 08:51:17,082 INFO L290 TraceCheckUtils]: 116: Hoare triple {88493#false} assume !(10 == ~blastFlag~0); {88493#false} is VALID [2022-04-08 08:51:17,082 INFO L290 TraceCheckUtils]: 117: Hoare triple {88493#false} assume 13 == ~blastFlag~0; {88493#false} is VALID [2022-04-08 08:51:17,082 INFO L290 TraceCheckUtils]: 118: Hoare triple {88493#false} assume !false; {88493#false} is VALID [2022-04-08 08:51:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:51:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:51:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404853879] [2022-04-08 08:51:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404853879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:17,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:51:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777871176] [2022-04-08 08:51:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777871176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323625272] [2022-04-08 08:51:17,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:51:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-08 08:51:17,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:51:17,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:17,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:17,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:51:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:17,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:51:17,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:51:17,173 INFO L87 Difference]: Start difference. First operand 823 states and 1282 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:24,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:27,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:33,001 INFO L93 Difference]: Finished difference Result 2085 states and 3248 transitions. [2022-04-08 08:51:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:51:33,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-08 08:51:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:51:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-08 08:51:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-08 08:51:33,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-08 08:51:33,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 606 edges. 606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:33,489 INFO L225 Difference]: With dead ends: 2085 [2022-04-08 08:51:33,489 INFO L226 Difference]: Without dead ends: 1288 [2022-04-08 08:51:33,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:51:33,491 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 128 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:51:33,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 388 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 08:51:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2022-04-08 08:51:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 913. [2022-04-08 08:51:33,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:51:33,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1288 states. Second operand has 913 states, 908 states have (on average 1.5759911894273129) internal successors, (1431), 908 states have internal predecessors, (1431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:33,539 INFO L74 IsIncluded]: Start isIncluded. First operand 1288 states. Second operand has 913 states, 908 states have (on average 1.5759911894273129) internal successors, (1431), 908 states have internal predecessors, (1431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:33,540 INFO L87 Difference]: Start difference. First operand 1288 states. Second operand has 913 states, 908 states have (on average 1.5759911894273129) internal successors, (1431), 908 states have internal predecessors, (1431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:33,583 INFO L93 Difference]: Finished difference Result 1288 states and 1991 transitions. [2022-04-08 08:51:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1991 transitions. [2022-04-08 08:51:33,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:33,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:33,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 913 states, 908 states have (on average 1.5759911894273129) internal successors, (1431), 908 states have internal predecessors, (1431), 3 states have call successors, (3), 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 1288 states. [2022-04-08 08:51:33,585 INFO L87 Difference]: Start difference. First operand has 913 states, 908 states have (on average 1.5759911894273129) internal successors, (1431), 908 states have internal predecessors, (1431), 3 states have call successors, (3), 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 1288 states. [2022-04-08 08:51:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:33,629 INFO L93 Difference]: Finished difference Result 1288 states and 1991 transitions. [2022-04-08 08:51:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1991 transitions. [2022-04-08 08:51:33,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:33,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:33,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:51:33,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:51:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 908 states have (on average 1.5759911894273129) internal successors, (1431), 908 states have internal predecessors, (1431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1435 transitions. [2022-04-08 08:51:33,681 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1435 transitions. Word has length 119 [2022-04-08 08:51:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:51:33,682 INFO L478 AbstractCegarLoop]: Abstraction has 913 states and 1435 transitions. [2022-04-08 08:51:33,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:33,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 913 states and 1435 transitions. [2022-04-08 08:51:37,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1435 edges. 1434 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1435 transitions. [2022-04-08 08:51:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-08 08:51:37,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:51:37,558 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:51:37,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:51:37,558 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:51:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:51:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash -72062084, now seen corresponding path program 1 times [2022-04-08 08:51:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:37,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558306808] [2022-04-08 08:51:37,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:51:37,627 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:51:37,627 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:51:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash -72062084, now seen corresponding path program 2 times [2022-04-08 08:51:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:51:37,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588293431] [2022-04-08 08:51:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:51:37,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:51:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:51:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:37,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {97083#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {97076#true} is VALID [2022-04-08 08:51:37,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {97076#true} assume true; {97076#true} is VALID [2022-04-08 08:51:37,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97076#true} {97076#true} #708#return; {97076#true} is VALID [2022-04-08 08:51:37,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {97076#true} call ULTIMATE.init(); {97083#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:51:37,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {97083#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {97076#true} is VALID [2022-04-08 08:51:37,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {97076#true} assume true; {97076#true} is VALID [2022-04-08 08:51:37,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97076#true} {97076#true} #708#return; {97076#true} is VALID [2022-04-08 08:51:37,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {97076#true} call #t~ret161 := main(); {97076#true} is VALID [2022-04-08 08:51:37,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {97076#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {97076#true} is VALID [2022-04-08 08:51:37,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {97076#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,881 INFO L272 TraceCheckUtils]: 7: Hoare triple {97076#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {97076#true} is VALID [2022-04-08 08:51:37,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {97076#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {97076#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {97076#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {97076#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {97076#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {97076#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {97076#true} assume !false; {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {97076#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {97076#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {97076#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {97076#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {97076#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {97076#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {97076#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {97076#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {97076#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97076#true} is VALID [2022-04-08 08:51:37,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {97076#true} assume 8464 == #t~mem55;havoc #t~mem55; {97076#true} is VALID [2022-04-08 08:51:37,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {97076#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {97076#true} is VALID [2022-04-08 08:51:37,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {97076#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {97076#true} is VALID [2022-04-08 08:51:37,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {97076#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:37,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:37,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:37,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:37,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:37,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {97081#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97082#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-08 08:51:37,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {97082#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {97077#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {97077#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {97077#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {97077#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {97077#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {97077#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {97077#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {97077#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {97077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {97077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97077#false} is VALID [2022-04-08 08:51:37,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {97077#false} ~skip~0 := 0; {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {97077#false} assume !false; {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {97077#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {97077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {97077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {97077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {97077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {97077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {97077#false} assume 8480 == #t~mem52;havoc #t~mem52; {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {97077#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {97077#false} is VALID [2022-04-08 08:51:37,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {97077#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {97077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {97077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {97077#false} ~skip~0 := 0; {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {97077#false} assume !false; {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {97077#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {97077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {97077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {97077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {97077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {97077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {97077#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 66: Hoare triple {97077#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {97077#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 68: Hoare triple {97077#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {97077#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {97077#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 71: Hoare triple {97077#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 72: Hoare triple {97077#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 73: Hoare triple {97077#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 74: Hoare triple {97077#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 75: Hoare triple {97077#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,891 INFO L290 TraceCheckUtils]: 76: Hoare triple {97077#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 77: Hoare triple {97077#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 78: Hoare triple {97077#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 79: Hoare triple {97077#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 80: Hoare triple {97077#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 81: Hoare triple {97077#false} assume 8448 == #t~mem68;havoc #t~mem68; {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 82: Hoare triple {97077#false} assume !(~num1~0 > 0); {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 83: Hoare triple {97077#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 84: Hoare triple {97077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 85: Hoare triple {97077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97077#false} is VALID [2022-04-08 08:51:37,892 INFO L290 TraceCheckUtils]: 86: Hoare triple {97077#false} ~skip~0 := 0; {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 87: Hoare triple {97077#false} assume !false; {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 88: Hoare triple {97077#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 89: Hoare triple {97077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 90: Hoare triple {97077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 91: Hoare triple {97077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 92: Hoare triple {97077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 93: Hoare triple {97077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 94: Hoare triple {97077#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 95: Hoare triple {97077#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 96: Hoare triple {97077#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,893 INFO L290 TraceCheckUtils]: 97: Hoare triple {97077#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 98: Hoare triple {97077#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 99: Hoare triple {97077#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 100: Hoare triple {97077#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 101: Hoare triple {97077#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 102: Hoare triple {97077#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 103: Hoare triple {97077#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 104: Hoare triple {97077#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 105: Hoare triple {97077#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 106: Hoare triple {97077#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 107: Hoare triple {97077#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,894 INFO L290 TraceCheckUtils]: 108: Hoare triple {97077#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 109: Hoare triple {97077#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 110: Hoare triple {97077#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 111: Hoare triple {97077#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 112: Hoare triple {97077#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 113: Hoare triple {97077#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 114: Hoare triple {97077#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 115: Hoare triple {97077#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 116: Hoare triple {97077#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 117: Hoare triple {97077#false} assume 8640 == #t~mem75;havoc #t~mem75; {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 118: Hoare triple {97077#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {97077#false} is VALID [2022-04-08 08:51:37,895 INFO L290 TraceCheckUtils]: 119: Hoare triple {97077#false} assume !(4 == ~blastFlag~0); {97077#false} is VALID [2022-04-08 08:51:37,896 INFO L290 TraceCheckUtils]: 120: Hoare triple {97077#false} assume !(7 == ~blastFlag~0); {97077#false} is VALID [2022-04-08 08:51:37,896 INFO L290 TraceCheckUtils]: 121: Hoare triple {97077#false} assume !(10 == ~blastFlag~0); {97077#false} is VALID [2022-04-08 08:51:37,896 INFO L290 TraceCheckUtils]: 122: Hoare triple {97077#false} assume 13 == ~blastFlag~0; {97077#false} is VALID [2022-04-08 08:51:37,896 INFO L290 TraceCheckUtils]: 123: Hoare triple {97077#false} assume !false; {97077#false} is VALID [2022-04-08 08:51:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 08:51:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:51:37,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588293431] [2022-04-08 08:51:37,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588293431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:37,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:37,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:37,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:51:37,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558306808] [2022-04-08 08:51:37,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558306808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:37,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:37,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:37,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963825056] [2022-04-08 08:51:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:51:37,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 124 [2022-04-08 08:51:37,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:51:37,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:37,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:37,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:51:37,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:51:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:51:37,991 INFO L87 Difference]: Start difference. First operand 913 states and 1435 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:40,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:42,185 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-08 08:51:46,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:49,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:54,493 INFO L93 Difference]: Finished difference Result 1756 states and 2716 transitions. [2022-04-08 08:51:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:51:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 124 [2022-04-08 08:51:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:51:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-08 08:51:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-08 08:51:54,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-08 08:51:54,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:54,993 INFO L225 Difference]: With dead ends: 1756 [2022-04-08 08:51:54,993 INFO L226 Difference]: Without dead ends: 1130 [2022-04-08 08:51:54,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:51:54,994 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 150 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:51:54,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 368 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-04-08 08:51:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2022-04-08 08:51:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 913. [2022-04-08 08:51:55,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:51:55,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1130 states. Second operand has 913 states, 908 states have (on average 1.5594713656387664) internal successors, (1416), 908 states have internal predecessors, (1416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:55,073 INFO L74 IsIncluded]: Start isIncluded. First operand 1130 states. Second operand has 913 states, 908 states have (on average 1.5594713656387664) internal successors, (1416), 908 states have internal predecessors, (1416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:55,073 INFO L87 Difference]: Start difference. First operand 1130 states. Second operand has 913 states, 908 states have (on average 1.5594713656387664) internal successors, (1416), 908 states have internal predecessors, (1416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:55,108 INFO L93 Difference]: Finished difference Result 1130 states and 1715 transitions. [2022-04-08 08:51:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1715 transitions. [2022-04-08 08:51:55,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:55,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:55,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 913 states, 908 states have (on average 1.5594713656387664) internal successors, (1416), 908 states have internal predecessors, (1416), 3 states have call successors, (3), 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 1130 states. [2022-04-08 08:51:55,110 INFO L87 Difference]: Start difference. First operand has 913 states, 908 states have (on average 1.5594713656387664) internal successors, (1416), 908 states have internal predecessors, (1416), 3 states have call successors, (3), 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 1130 states. [2022-04-08 08:51:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:55,145 INFO L93 Difference]: Finished difference Result 1130 states and 1715 transitions. [2022-04-08 08:51:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1715 transitions. [2022-04-08 08:51:55,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:55,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:55,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:51:55,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:51:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 908 states have (on average 1.5594713656387664) internal successors, (1416), 908 states have internal predecessors, (1416), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1420 transitions. [2022-04-08 08:51:55,179 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1420 transitions. Word has length 124 [2022-04-08 08:51:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:51:55,179 INFO L478 AbstractCegarLoop]: Abstraction has 913 states and 1420 transitions. [2022-04-08 08:51:55,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:55,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 913 states and 1420 transitions. [2022-04-08 08:51:59,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1420 edges. 1419 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1420 transitions. [2022-04-08 08:51:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-08 08:51:59,044 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:51:59,044 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:51:59,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:51:59,044 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:51:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:51:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash -933759754, now seen corresponding path program 1 times [2022-04-08 08:51:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:59,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [737876248] [2022-04-08 08:51:59,106 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:51:59,107 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:51:59,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:51:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash -933759754, now seen corresponding path program 2 times [2022-04-08 08:51:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:51:59,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254353159] [2022-04-08 08:51:59,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:51:59,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:51:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:51:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:59,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {104693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {104686#true} is VALID [2022-04-08 08:51:59,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {104686#true} assume true; {104686#true} is VALID [2022-04-08 08:51:59,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104686#true} {104686#true} #708#return; {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {104686#true} call ULTIMATE.init(); {104693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {104693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {104686#true} assume true; {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104686#true} {104686#true} #708#return; {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {104686#true} call #t~ret161 := main(); {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {104686#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {104686#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L272 TraceCheckUtils]: 7: Hoare triple {104686#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {104686#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {104686#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {104686#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {104686#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {104686#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {104686#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {104686#true} assume !false; {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {104686#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {104686#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {104686#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {104686#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {104686#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {104686#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {104686#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {104686#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {104686#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {104686#true} assume 8464 == #t~mem55;havoc #t~mem55; {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {104686#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {104686#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {104686#true} is VALID [2022-04-08 08:51:59,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {104686#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {104686#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {104686#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {104686#true} ~skip~0 := 0; {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {104686#true} assume !false; {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {104686#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {104686#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {104686#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {104686#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {104686#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {104686#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {104686#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {104686#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {104686#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {104686#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {104686#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {104686#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {104686#true} assume 8496 == #t~mem58;havoc #t~mem58; {104686#true} is VALID [2022-04-08 08:51:59,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {104686#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {104686#true} is VALID [2022-04-08 08:51:59,365 INFO L290 TraceCheckUtils]: 46: Hoare triple {104686#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {104686#true} is VALID [2022-04-08 08:51:59,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {104686#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {104686#true} is VALID [2022-04-08 08:51:59,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {104686#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,371 INFO L290 TraceCheckUtils]: 62: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,371 INFO L290 TraceCheckUtils]: 63: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,373 INFO L290 TraceCheckUtils]: 66: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,374 INFO L290 TraceCheckUtils]: 70: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,374 INFO L290 TraceCheckUtils]: 71: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,376 INFO L290 TraceCheckUtils]: 76: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,378 INFO L290 TraceCheckUtils]: 79: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:59,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {104691#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {104692#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-08 08:51:59,379 INFO L290 TraceCheckUtils]: 81: Hoare triple {104692#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {104687#false} is VALID [2022-04-08 08:51:59,379 INFO L290 TraceCheckUtils]: 82: Hoare triple {104687#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {104687#false} is VALID [2022-04-08 08:51:59,379 INFO L290 TraceCheckUtils]: 83: Hoare triple {104687#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,379 INFO L290 TraceCheckUtils]: 84: Hoare triple {104687#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,379 INFO L290 TraceCheckUtils]: 85: Hoare triple {104687#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {104687#false} is VALID [2022-04-08 08:51:59,379 INFO L290 TraceCheckUtils]: 86: Hoare triple {104687#false} ~skip~0 := 0; {104687#false} is VALID [2022-04-08 08:51:59,379 INFO L290 TraceCheckUtils]: 87: Hoare triple {104687#false} assume !false; {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 88: Hoare triple {104687#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 89: Hoare triple {104687#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 90: Hoare triple {104687#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 91: Hoare triple {104687#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {104687#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 93: Hoare triple {104687#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {104687#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 95: Hoare triple {104687#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 96: Hoare triple {104687#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,380 INFO L290 TraceCheckUtils]: 97: Hoare triple {104687#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 98: Hoare triple {104687#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 99: Hoare triple {104687#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 100: Hoare triple {104687#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 101: Hoare triple {104687#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 102: Hoare triple {104687#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 103: Hoare triple {104687#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 104: Hoare triple {104687#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 105: Hoare triple {104687#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 106: Hoare triple {104687#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,381 INFO L290 TraceCheckUtils]: 107: Hoare triple {104687#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 108: Hoare triple {104687#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 109: Hoare triple {104687#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 110: Hoare triple {104687#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 111: Hoare triple {104687#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 112: Hoare triple {104687#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 113: Hoare triple {104687#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 114: Hoare triple {104687#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 115: Hoare triple {104687#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 116: Hoare triple {104687#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {104687#false} is VALID [2022-04-08 08:51:59,382 INFO L290 TraceCheckUtils]: 117: Hoare triple {104687#false} assume 8640 == #t~mem75;havoc #t~mem75; {104687#false} is VALID [2022-04-08 08:51:59,383 INFO L290 TraceCheckUtils]: 118: Hoare triple {104687#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {104687#false} is VALID [2022-04-08 08:51:59,383 INFO L290 TraceCheckUtils]: 119: Hoare triple {104687#false} assume !(4 == ~blastFlag~0); {104687#false} is VALID [2022-04-08 08:51:59,383 INFO L290 TraceCheckUtils]: 120: Hoare triple {104687#false} assume !(7 == ~blastFlag~0); {104687#false} is VALID [2022-04-08 08:51:59,383 INFO L290 TraceCheckUtils]: 121: Hoare triple {104687#false} assume !(10 == ~blastFlag~0); {104687#false} is VALID [2022-04-08 08:51:59,383 INFO L290 TraceCheckUtils]: 122: Hoare triple {104687#false} assume 13 == ~blastFlag~0; {104687#false} is VALID [2022-04-08 08:51:59,383 INFO L290 TraceCheckUtils]: 123: Hoare triple {104687#false} assume !false; {104687#false} is VALID [2022-04-08 08:51:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:51:59,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:51:59,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254353159] [2022-04-08 08:51:59,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254353159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:59,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:59,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:59,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:51:59,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [737876248] [2022-04-08 08:51:59,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [737876248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:59,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:59,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:59,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523040687] [2022-04-08 08:51:59,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:51:59,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-08 08:51:59,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:51:59,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:59,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:59,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:51:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:51:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:51:59,465 INFO L87 Difference]: Start difference. First operand 913 states and 1420 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:03,059 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-08 08:52:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:14,506 INFO L93 Difference]: Finished difference Result 2137 states and 3302 transitions. [2022-04-08 08:52:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:52:14,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-08 08:52:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:52:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-08 08:52:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-08 08:52:14,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-04-08 08:52:14,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:14,990 INFO L225 Difference]: With dead ends: 2137 [2022-04-08 08:52:14,990 INFO L226 Difference]: Without dead ends: 1250 [2022-04-08 08:52:14,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:52:14,991 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 123 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:52:14,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 368 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-08 08:52:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-04-08 08:52:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1024. [2022-04-08 08:52:15,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:52:15,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1250 states. Second operand has 1024 states, 1019 states have (on average 1.5662414131501472) internal successors, (1596), 1019 states have internal predecessors, (1596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:15,069 INFO L74 IsIncluded]: Start isIncluded. First operand 1250 states. Second operand has 1024 states, 1019 states have (on average 1.5662414131501472) internal successors, (1596), 1019 states have internal predecessors, (1596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:15,070 INFO L87 Difference]: Start difference. First operand 1250 states. Second operand has 1024 states, 1019 states have (on average 1.5662414131501472) internal successors, (1596), 1019 states have internal predecessors, (1596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:15,109 INFO L93 Difference]: Finished difference Result 1250 states and 1907 transitions. [2022-04-08 08:52:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1907 transitions. [2022-04-08 08:52:15,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:15,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:15,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 1019 states have (on average 1.5662414131501472) internal successors, (1596), 1019 states have internal predecessors, (1596), 3 states have call successors, (3), 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 1250 states. [2022-04-08 08:52:15,112 INFO L87 Difference]: Start difference. First operand has 1024 states, 1019 states have (on average 1.5662414131501472) internal successors, (1596), 1019 states have internal predecessors, (1596), 3 states have call successors, (3), 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 1250 states. [2022-04-08 08:52:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:15,153 INFO L93 Difference]: Finished difference Result 1250 states and 1907 transitions. [2022-04-08 08:52:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1907 transitions. [2022-04-08 08:52:15,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:15,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:15,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:52:15,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:52:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 1.5662414131501472) internal successors, (1596), 1019 states have internal predecessors, (1596), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1600 transitions. [2022-04-08 08:52:15,196 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1600 transitions. Word has length 124 [2022-04-08 08:52:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:52:15,196 INFO L478 AbstractCegarLoop]: Abstraction has 1024 states and 1600 transitions. [2022-04-08 08:52:15,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:15,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1024 states and 1600 transitions. [2022-04-08 08:52:19,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1600 edges. 1599 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1600 transitions. [2022-04-08 08:52:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-08 08:52:19,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:52:19,259 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:52:19,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 08:52:19,259 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:52:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:52:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash -315199378, now seen corresponding path program 1 times [2022-04-08 08:52:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:19,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881021052] [2022-04-08 08:52:19,332 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:52:19,332 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:52:19,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:52:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash -315199378, now seen corresponding path program 2 times [2022-04-08 08:52:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:52:19,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059792840] [2022-04-08 08:52:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:52:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:52:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:52:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:19,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {113527#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {113520#true} is VALID [2022-04-08 08:52:19,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {113520#true} assume true; {113520#true} is VALID [2022-04-08 08:52:19,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113520#true} {113520#true} #708#return; {113520#true} is VALID [2022-04-08 08:52:19,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {113520#true} call ULTIMATE.init(); {113527#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:52:19,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {113527#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {113520#true} is VALID [2022-04-08 08:52:19,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {113520#true} assume true; {113520#true} is VALID [2022-04-08 08:52:19,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113520#true} {113520#true} #708#return; {113520#true} is VALID [2022-04-08 08:52:19,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {113520#true} call #t~ret161 := main(); {113520#true} is VALID [2022-04-08 08:52:19,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {113520#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {113520#true} is VALID [2022-04-08 08:52:19,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {113520#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,590 INFO L272 TraceCheckUtils]: 7: Hoare triple {113520#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {113520#true} is VALID [2022-04-08 08:52:19,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {113520#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {113520#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {113520#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {113520#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {113520#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {113520#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {113520#true} assume !false; {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {113520#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {113520#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {113520#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {113520#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {113520#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {113520#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {113520#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {113520#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {113520#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {113520#true} assume 8464 == #t~mem55;havoc #t~mem55; {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {113520#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {113520#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {113520#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {113520#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {113520#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {113520#true} is VALID [2022-04-08 08:52:19,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {113520#true} ~skip~0 := 0; {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {113520#true} assume !false; {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {113520#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {113520#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {113520#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {113520#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {113520#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {113520#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {113520#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {113520#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {113520#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {113520#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {113520#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {113520#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {113520#true} assume 8496 == #t~mem58;havoc #t~mem58; {113520#true} is VALID [2022-04-08 08:52:19,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {113520#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {113520#true} is VALID [2022-04-08 08:52:19,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {113520#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {113520#true} is VALID [2022-04-08 08:52:19,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {113520#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {113520#true} is VALID [2022-04-08 08:52:19,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {113520#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,601 INFO L290 TraceCheckUtils]: 60: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,603 INFO L290 TraceCheckUtils]: 64: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,603 INFO L290 TraceCheckUtils]: 65: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,604 INFO L290 TraceCheckUtils]: 67: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,605 INFO L290 TraceCheckUtils]: 69: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,605 INFO L290 TraceCheckUtils]: 70: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,607 INFO L290 TraceCheckUtils]: 73: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,607 INFO L290 TraceCheckUtils]: 74: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,608 INFO L290 TraceCheckUtils]: 75: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,609 INFO L290 TraceCheckUtils]: 77: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,609 INFO L290 TraceCheckUtils]: 78: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,609 INFO L290 TraceCheckUtils]: 79: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,610 INFO L290 TraceCheckUtils]: 80: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:52:19,610 INFO L290 TraceCheckUtils]: 81: Hoare triple {113525#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {113526#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 82: Hoare triple {113526#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {113521#false} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 83: Hoare triple {113521#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {113521#false} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 84: Hoare triple {113521#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 85: Hoare triple {113521#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 86: Hoare triple {113521#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {113521#false} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 87: Hoare triple {113521#false} ~skip~0 := 0; {113521#false} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 88: Hoare triple {113521#false} assume !false; {113521#false} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 89: Hoare triple {113521#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,611 INFO L290 TraceCheckUtils]: 90: Hoare triple {113521#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 91: Hoare triple {113521#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 92: Hoare triple {113521#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 93: Hoare triple {113521#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 94: Hoare triple {113521#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 95: Hoare triple {113521#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 96: Hoare triple {113521#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 97: Hoare triple {113521#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 98: Hoare triple {113521#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 99: Hoare triple {113521#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,612 INFO L290 TraceCheckUtils]: 100: Hoare triple {113521#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 101: Hoare triple {113521#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 102: Hoare triple {113521#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 103: Hoare triple {113521#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 104: Hoare triple {113521#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 105: Hoare triple {113521#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 106: Hoare triple {113521#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 107: Hoare triple {113521#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 108: Hoare triple {113521#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 109: Hoare triple {113521#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 110: Hoare triple {113521#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,613 INFO L290 TraceCheckUtils]: 111: Hoare triple {113521#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 112: Hoare triple {113521#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 113: Hoare triple {113521#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 114: Hoare triple {113521#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 115: Hoare triple {113521#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 116: Hoare triple {113521#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 117: Hoare triple {113521#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 118: Hoare triple {113521#false} assume 8640 == #t~mem75;havoc #t~mem75; {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 119: Hoare triple {113521#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 120: Hoare triple {113521#false} assume !(4 == ~blastFlag~0); {113521#false} is VALID [2022-04-08 08:52:19,614 INFO L290 TraceCheckUtils]: 121: Hoare triple {113521#false} assume !(7 == ~blastFlag~0); {113521#false} is VALID [2022-04-08 08:52:19,615 INFO L290 TraceCheckUtils]: 122: Hoare triple {113521#false} assume !(10 == ~blastFlag~0); {113521#false} is VALID [2022-04-08 08:52:19,615 INFO L290 TraceCheckUtils]: 123: Hoare triple {113521#false} assume 13 == ~blastFlag~0; {113521#false} is VALID [2022-04-08 08:52:19,615 INFO L290 TraceCheckUtils]: 124: Hoare triple {113521#false} assume !false; {113521#false} is VALID [2022-04-08 08:52:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:52:19,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:52:19,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059792840] [2022-04-08 08:52:19,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059792840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:19,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:19,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:19,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:52:19,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881021052] [2022-04-08 08:52:19,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881021052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:19,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:19,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981769431] [2022-04-08 08:52:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:52:19,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-08 08:52:19,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:52:19,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:19,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:19,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:52:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:52:19,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:52:19,719 INFO L87 Difference]: Start difference. First operand 1024 states and 1600 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:27,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:36,090 INFO L93 Difference]: Finished difference Result 2239 states and 3464 transitions. [2022-04-08 08:52:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:52:36,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-08 08:52:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:52:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-08 08:52:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-08 08:52:36,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-04-08 08:52:36,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:36,569 INFO L225 Difference]: With dead ends: 2239 [2022-04-08 08:52:36,569 INFO L226 Difference]: Without dead ends: 1241 [2022-04-08 08:52:36,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:52:36,571 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 122 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:52:36,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 368 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 08:52:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2022-04-08 08:52:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1024. [2022-04-08 08:52:36,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:52:36,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1241 states. Second operand has 1024 states, 1019 states have (on average 1.5603532875368007) internal successors, (1590), 1019 states have internal predecessors, (1590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:36,650 INFO L74 IsIncluded]: Start isIncluded. First operand 1241 states. Second operand has 1024 states, 1019 states have (on average 1.5603532875368007) internal successors, (1590), 1019 states have internal predecessors, (1590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:36,651 INFO L87 Difference]: Start difference. First operand 1241 states. Second operand has 1024 states, 1019 states have (on average 1.5603532875368007) internal successors, (1590), 1019 states have internal predecessors, (1590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:36,692 INFO L93 Difference]: Finished difference Result 1241 states and 1889 transitions. [2022-04-08 08:52:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1889 transitions. [2022-04-08 08:52:36,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:36,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:36,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 1019 states have (on average 1.5603532875368007) internal successors, (1590), 1019 states have internal predecessors, (1590), 3 states have call successors, (3), 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 1241 states. [2022-04-08 08:52:36,694 INFO L87 Difference]: Start difference. First operand has 1024 states, 1019 states have (on average 1.5603532875368007) internal successors, (1590), 1019 states have internal predecessors, (1590), 3 states have call successors, (3), 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 1241 states. [2022-04-08 08:52:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:36,734 INFO L93 Difference]: Finished difference Result 1241 states and 1889 transitions. [2022-04-08 08:52:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1889 transitions. [2022-04-08 08:52:36,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:36,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:36,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:52:36,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:52:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 1.5603532875368007) internal successors, (1590), 1019 states have internal predecessors, (1590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1594 transitions. [2022-04-08 08:52:36,776 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1594 transitions. Word has length 125 [2022-04-08 08:52:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:52:36,777 INFO L478 AbstractCegarLoop]: Abstraction has 1024 states and 1594 transitions. [2022-04-08 08:52:36,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:36,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1024 states and 1594 transitions. [2022-04-08 08:52:40,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1594 edges. 1593 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1594 transitions. [2022-04-08 08:52:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 08:52:40,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:52:40,835 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:52:40,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 08:52:40,835 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:52:40,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:52:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1537626722, now seen corresponding path program 1 times [2022-04-08 08:52:40,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:40,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254438603] [2022-04-08 08:52:40,913 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:52:40,913 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:52:40,913 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:52:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1537626722, now seen corresponding path program 2 times [2022-04-08 08:52:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:52:40,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91116553] [2022-04-08 08:52:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:52:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:52:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:41,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:52:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:41,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {122547#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {122540#true} is VALID [2022-04-08 08:52:41,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {122540#true} assume true; {122540#true} is VALID [2022-04-08 08:52:41,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122540#true} {122540#true} #708#return; {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {122540#true} call ULTIMATE.init(); {122547#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {122547#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {122540#true} assume true; {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122540#true} {122540#true} #708#return; {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {122540#true} call #t~ret161 := main(); {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {122540#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {122540#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L272 TraceCheckUtils]: 7: Hoare triple {122540#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {122540#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {122540#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {122540#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {122540#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {122540#true} is VALID [2022-04-08 08:52:41,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {122540#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {122540#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {122540#true} assume !false; {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {122540#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {122540#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {122540#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {122540#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {122540#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {122540#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {122540#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {122540#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {122540#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {122540#true} assume 8464 == #t~mem55;havoc #t~mem55; {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {122540#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {122540#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {122540#true} is VALID [2022-04-08 08:52:41,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {122540#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {122540#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {122540#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {122540#true} ~skip~0 := 0; {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {122540#true} assume !false; {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {122540#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {122540#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {122540#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {122540#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {122540#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {122540#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {122540#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {122540#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {122540#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {122540#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {122540#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {122540#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {122540#true} assume 8496 == #t~mem58;havoc #t~mem58; {122540#true} is VALID [2022-04-08 08:52:41,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {122540#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {122540#true} is VALID [2022-04-08 08:52:41,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {122540#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {122540#true} is VALID [2022-04-08 08:52:41,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {122540#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {122540#true} is VALID [2022-04-08 08:52:41,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {122540#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,164 INFO L290 TraceCheckUtils]: 59: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,164 INFO L290 TraceCheckUtils]: 60: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,165 INFO L290 TraceCheckUtils]: 61: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,165 INFO L290 TraceCheckUtils]: 62: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,165 INFO L290 TraceCheckUtils]: 63: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,166 INFO L290 TraceCheckUtils]: 64: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,166 INFO L290 TraceCheckUtils]: 66: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,168 INFO L290 TraceCheckUtils]: 71: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,169 INFO L290 TraceCheckUtils]: 72: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,169 INFO L290 TraceCheckUtils]: 73: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,169 INFO L290 TraceCheckUtils]: 74: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,170 INFO L290 TraceCheckUtils]: 75: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,170 INFO L290 TraceCheckUtils]: 76: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,170 INFO L290 TraceCheckUtils]: 77: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,171 INFO L290 TraceCheckUtils]: 78: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,171 INFO L290 TraceCheckUtils]: 79: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,171 INFO L290 TraceCheckUtils]: 80: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,172 INFO L290 TraceCheckUtils]: 81: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,172 INFO L290 TraceCheckUtils]: 82: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,172 INFO L290 TraceCheckUtils]: 83: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,173 INFO L290 TraceCheckUtils]: 85: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 86: Hoare triple {122545#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {122546#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 87: Hoare triple {122546#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {122541#false} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 88: Hoare triple {122541#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {122541#false} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 89: Hoare triple {122541#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {122541#false} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 90: Hoare triple {122541#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 91: Hoare triple {122541#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {122541#false} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {122541#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 93: Hoare triple {122541#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,174 INFO L290 TraceCheckUtils]: 94: Hoare triple {122541#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 95: Hoare triple {122541#false} ~skip~0 := 0; {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 96: Hoare triple {122541#false} assume !false; {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 97: Hoare triple {122541#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 98: Hoare triple {122541#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 99: Hoare triple {122541#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 100: Hoare triple {122541#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 101: Hoare triple {122541#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 102: Hoare triple {122541#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 103: Hoare triple {122541#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 104: Hoare triple {122541#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 105: Hoare triple {122541#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 106: Hoare triple {122541#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,175 INFO L290 TraceCheckUtils]: 107: Hoare triple {122541#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 108: Hoare triple {122541#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 109: Hoare triple {122541#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 110: Hoare triple {122541#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 111: Hoare triple {122541#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 112: Hoare triple {122541#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 113: Hoare triple {122541#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 114: Hoare triple {122541#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 115: Hoare triple {122541#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 116: Hoare triple {122541#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,176 INFO L290 TraceCheckUtils]: 117: Hoare triple {122541#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 118: Hoare triple {122541#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 119: Hoare triple {122541#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 120: Hoare triple {122541#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 121: Hoare triple {122541#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 122: Hoare triple {122541#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 123: Hoare triple {122541#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 124: Hoare triple {122541#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 125: Hoare triple {122541#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {122541#false} is VALID [2022-04-08 08:52:41,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {122541#false} assume 8640 == #t~mem75;havoc #t~mem75; {122541#false} is VALID [2022-04-08 08:52:41,178 INFO L290 TraceCheckUtils]: 127: Hoare triple {122541#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {122541#false} is VALID [2022-04-08 08:52:41,178 INFO L290 TraceCheckUtils]: 128: Hoare triple {122541#false} assume !(4 == ~blastFlag~0); {122541#false} is VALID [2022-04-08 08:52:41,178 INFO L290 TraceCheckUtils]: 129: Hoare triple {122541#false} assume !(7 == ~blastFlag~0); {122541#false} is VALID [2022-04-08 08:52:41,178 INFO L290 TraceCheckUtils]: 130: Hoare triple {122541#false} assume !(10 == ~blastFlag~0); {122541#false} is VALID [2022-04-08 08:52:41,178 INFO L290 TraceCheckUtils]: 131: Hoare triple {122541#false} assume 13 == ~blastFlag~0; {122541#false} is VALID [2022-04-08 08:52:41,178 INFO L290 TraceCheckUtils]: 132: Hoare triple {122541#false} assume !false; {122541#false} is VALID [2022-04-08 08:52:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:52:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:52:41,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91116553] [2022-04-08 08:52:41,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91116553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:41,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:41,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:41,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:52:41,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254438603] [2022-04-08 08:52:41,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254438603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:41,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:41,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724948727] [2022-04-08 08:52:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:52:41,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 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 133 [2022-04-08 08:52:41,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:52:41,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:41,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:41,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:52:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:52:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:52:41,278 INFO L87 Difference]: Start difference. First operand 1024 states and 1594 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:43,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:47,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:51,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:53,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:58,517 INFO L93 Difference]: Finished difference Result 2359 states and 3644 transitions. [2022-04-08 08:52:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:52:58,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 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 133 [2022-04-08 08:52:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:52:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:52:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:52:58,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 607 transitions. [2022-04-08 08:52:58,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:59,015 INFO L225 Difference]: With dead ends: 2359 [2022-04-08 08:52:59,016 INFO L226 Difference]: Without dead ends: 1361 [2022-04-08 08:52:59,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:52:59,017 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 115 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:52:59,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 369 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-04-08 08:52:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2022-04-08 08:52:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1153. [2022-04-08 08:52:59,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:52:59,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1361 states. Second operand has 1153 states, 1148 states have (on average 1.5653310104529616) internal successors, (1797), 1148 states have internal predecessors, (1797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:59,095 INFO L74 IsIncluded]: Start isIncluded. First operand 1361 states. Second operand has 1153 states, 1148 states have (on average 1.5653310104529616) internal successors, (1797), 1148 states have internal predecessors, (1797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:59,096 INFO L87 Difference]: Start difference. First operand 1361 states. Second operand has 1153 states, 1148 states have (on average 1.5653310104529616) internal successors, (1797), 1148 states have internal predecessors, (1797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:59,140 INFO L93 Difference]: Finished difference Result 1361 states and 2078 transitions. [2022-04-08 08:52:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2078 transitions. [2022-04-08 08:52:59,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:59,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:59,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 1153 states, 1148 states have (on average 1.5653310104529616) internal successors, (1797), 1148 states have internal predecessors, (1797), 3 states have call successors, (3), 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 1361 states. [2022-04-08 08:52:59,143 INFO L87 Difference]: Start difference. First operand has 1153 states, 1148 states have (on average 1.5653310104529616) internal successors, (1797), 1148 states have internal predecessors, (1797), 3 states have call successors, (3), 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 1361 states. [2022-04-08 08:52:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:59,189 INFO L93 Difference]: Finished difference Result 1361 states and 2078 transitions. [2022-04-08 08:52:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2078 transitions. [2022-04-08 08:52:59,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:59,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:59,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:52:59,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:52:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1148 states have (on average 1.5653310104529616) internal successors, (1797), 1148 states have internal predecessors, (1797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1801 transitions. [2022-04-08 08:52:59,251 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1801 transitions. Word has length 133 [2022-04-08 08:52:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:52:59,251 INFO L478 AbstractCegarLoop]: Abstraction has 1153 states and 1801 transitions. [2022-04-08 08:52:59,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:59,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1153 states and 1801 transitions. [2022-04-08 08:53:03,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1801 edges. 1800 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1801 transitions. [2022-04-08 08:53:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-08 08:53:03,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:53:03,606 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:53:03,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-08 08:53:03,606 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:53:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:53:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1347108854, now seen corresponding path program 1 times [2022-04-08 08:53:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:03,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062760451] [2022-04-08 08:53:03,682 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:53:03,683 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:53:03,683 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:53:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1347108854, now seen corresponding path program 2 times [2022-04-08 08:53:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:53:03,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053225058] [2022-04-08 08:53:03,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:53:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:53:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:53:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:03,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {132305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {132298#true} is VALID [2022-04-08 08:53:03,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {132298#true} assume true; {132298#true} is VALID [2022-04-08 08:53:03,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132298#true} {132298#true} #708#return; {132298#true} is VALID [2022-04-08 08:53:03,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {132298#true} call ULTIMATE.init(); {132305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:53:03,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {132305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {132298#true} is VALID [2022-04-08 08:53:03,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {132298#true} assume true; {132298#true} is VALID [2022-04-08 08:53:03,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132298#true} {132298#true} #708#return; {132298#true} is VALID [2022-04-08 08:53:03,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {132298#true} call #t~ret161 := main(); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {132298#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {132298#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L272 TraceCheckUtils]: 7: Hoare triple {132298#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {132298#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {132298#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {132298#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {132298#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {132298#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {132298#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {132298#true} assume !false; {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {132298#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {132298#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {132298#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {132298#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {132298#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {132298#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {132298#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {132298#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {132298#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {132298#true} assume 8464 == #t~mem55;havoc #t~mem55; {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {132298#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {132298#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {132298#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {132298#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {132298#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {132298#true} ~skip~0 := 0; {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {132298#true} assume !false; {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {132298#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {132298#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {132298#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {132298#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {132298#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {132298#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {132298#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {132298#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {132298#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {132298#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {132298#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {132298#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {132298#true} assume 8496 == #t~mem58;havoc #t~mem58; {132298#true} is VALID [2022-04-08 08:53:03,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {132298#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {132298#true} is VALID [2022-04-08 08:53:03,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {132298#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {132298#true} is VALID [2022-04-08 08:53:03,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {132298#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {132298#true} is VALID [2022-04-08 08:53:03,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {132298#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,941 INFO L290 TraceCheckUtils]: 60: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,941 INFO L290 TraceCheckUtils]: 61: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,945 INFO L290 TraceCheckUtils]: 71: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,945 INFO L290 TraceCheckUtils]: 72: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,945 INFO L290 TraceCheckUtils]: 73: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,946 INFO L290 TraceCheckUtils]: 74: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,946 INFO L290 TraceCheckUtils]: 75: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,946 INFO L290 TraceCheckUtils]: 76: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,947 INFO L290 TraceCheckUtils]: 77: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,947 INFO L290 TraceCheckUtils]: 78: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,947 INFO L290 TraceCheckUtils]: 79: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,948 INFO L290 TraceCheckUtils]: 80: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,948 INFO L290 TraceCheckUtils]: 81: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,948 INFO L290 TraceCheckUtils]: 82: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,949 INFO L290 TraceCheckUtils]: 83: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:03,949 INFO L290 TraceCheckUtils]: 84: Hoare triple {132303#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {132304#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-08 08:53:03,949 INFO L290 TraceCheckUtils]: 85: Hoare triple {132304#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 86: Hoare triple {132299#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 87: Hoare triple {132299#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 88: Hoare triple {132299#false} assume 8673 == #t~mem80;havoc #t~mem80; {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 89: Hoare triple {132299#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 90: Hoare triple {132299#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 91: Hoare triple {132299#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 92: Hoare triple {132299#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 93: Hoare triple {132299#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 94: Hoare triple {132299#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 95: Hoare triple {132299#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 96: Hoare triple {132299#false} ~skip~0 := 0; {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 97: Hoare triple {132299#false} assume !false; {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 98: Hoare triple {132299#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,950 INFO L290 TraceCheckUtils]: 99: Hoare triple {132299#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 100: Hoare triple {132299#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 101: Hoare triple {132299#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 102: Hoare triple {132299#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 103: Hoare triple {132299#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 104: Hoare triple {132299#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 105: Hoare triple {132299#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 106: Hoare triple {132299#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 107: Hoare triple {132299#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 108: Hoare triple {132299#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 109: Hoare triple {132299#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 110: Hoare triple {132299#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 111: Hoare triple {132299#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 112: Hoare triple {132299#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,951 INFO L290 TraceCheckUtils]: 113: Hoare triple {132299#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 114: Hoare triple {132299#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 115: Hoare triple {132299#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 116: Hoare triple {132299#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 117: Hoare triple {132299#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 118: Hoare triple {132299#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 119: Hoare triple {132299#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 120: Hoare triple {132299#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 121: Hoare triple {132299#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 122: Hoare triple {132299#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 123: Hoare triple {132299#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 124: Hoare triple {132299#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 125: Hoare triple {132299#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 126: Hoare triple {132299#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 127: Hoare triple {132299#false} assume 8640 == #t~mem75;havoc #t~mem75; {132299#false} is VALID [2022-04-08 08:53:03,952 INFO L290 TraceCheckUtils]: 128: Hoare triple {132299#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {132299#false} is VALID [2022-04-08 08:53:03,953 INFO L290 TraceCheckUtils]: 129: Hoare triple {132299#false} assume !(4 == ~blastFlag~0); {132299#false} is VALID [2022-04-08 08:53:03,953 INFO L290 TraceCheckUtils]: 130: Hoare triple {132299#false} assume !(7 == ~blastFlag~0); {132299#false} is VALID [2022-04-08 08:53:03,953 INFO L290 TraceCheckUtils]: 131: Hoare triple {132299#false} assume !(10 == ~blastFlag~0); {132299#false} is VALID [2022-04-08 08:53:03,953 INFO L290 TraceCheckUtils]: 132: Hoare triple {132299#false} assume 13 == ~blastFlag~0; {132299#false} is VALID [2022-04-08 08:53:03,953 INFO L290 TraceCheckUtils]: 133: Hoare triple {132299#false} assume !false; {132299#false} is VALID [2022-04-08 08:53:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:53:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:53:03,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053225058] [2022-04-08 08:53:03,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053225058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:03,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:03,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:03,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:53:03,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062760451] [2022-04-08 08:53:03,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062760451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:03,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:03,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997768896] [2022-04-08 08:53:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:53:03,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 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 134 [2022-04-08 08:53:03,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:53:03,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:04,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:04,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:53:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:04,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:53:04,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:53:04,036 INFO L87 Difference]: Start difference. First operand 1153 states and 1801 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:07,508 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-08 08:53:10,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:12,165 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-08 08:53:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:19,414 INFO L93 Difference]: Finished difference Result 2518 states and 3919 transitions. [2022-04-08 08:53:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:53:19,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 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 134 [2022-04-08 08:53:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:53:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2022-04-08 08:53:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2022-04-08 08:53:19,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 550 transitions. [2022-04-08 08:53:19,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:19,860 INFO L225 Difference]: With dead ends: 2518 [2022-04-08 08:53:19,861 INFO L226 Difference]: Without dead ends: 1391 [2022-04-08 08:53:19,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:53:19,862 INFO L913 BasicCegarLoop]: 271 mSDtfsCounter, 61 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:53:19,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 663 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 601 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2022-04-08 08:53:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2022-04-08 08:53:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1282. [2022-04-08 08:53:19,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:53:19,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1391 states. Second operand has 1282 states, 1277 states have (on average 1.5646045418950665) internal successors, (1998), 1277 states have internal predecessors, (1998), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:19,962 INFO L74 IsIncluded]: Start isIncluded. First operand 1391 states. Second operand has 1282 states, 1277 states have (on average 1.5646045418950665) internal successors, (1998), 1277 states have internal predecessors, (1998), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:19,963 INFO L87 Difference]: Start difference. First operand 1391 states. Second operand has 1282 states, 1277 states have (on average 1.5646045418950665) internal successors, (1998), 1277 states have internal predecessors, (1998), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:20,009 INFO L93 Difference]: Finished difference Result 1391 states and 2146 transitions. [2022-04-08 08:53:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2146 transitions. [2022-04-08 08:53:20,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:20,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:20,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 1282 states, 1277 states have (on average 1.5646045418950665) internal successors, (1998), 1277 states have internal predecessors, (1998), 3 states have call successors, (3), 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 1391 states. [2022-04-08 08:53:20,012 INFO L87 Difference]: Start difference. First operand has 1282 states, 1277 states have (on average 1.5646045418950665) internal successors, (1998), 1277 states have internal predecessors, (1998), 3 states have call successors, (3), 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 1391 states. [2022-04-08 08:53:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:20,060 INFO L93 Difference]: Finished difference Result 1391 states and 2146 transitions. [2022-04-08 08:53:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2146 transitions. [2022-04-08 08:53:20,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:20,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:20,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:53:20,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:53:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1277 states have (on average 1.5646045418950665) internal successors, (1998), 1277 states have internal predecessors, (1998), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 2002 transitions. [2022-04-08 08:53:20,164 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 2002 transitions. Word has length 134 [2022-04-08 08:53:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:53:20,164 INFO L478 AbstractCegarLoop]: Abstraction has 1282 states and 2002 transitions. [2022-04-08 08:53:20,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:20,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1282 states and 2002 transitions. [2022-04-08 08:53:24,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2002 edges. 2001 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 2002 transitions. [2022-04-08 08:53:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-08 08:53:24,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:53:24,698 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:53:24,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-08 08:53:24,699 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:53:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:53:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash 989283656, now seen corresponding path program 1 times [2022-04-08 08:53:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:24,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401393611] [2022-04-08 08:53:24,783 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:53:24,784 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:53:24,784 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:53:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash 989283656, now seen corresponding path program 2 times [2022-04-08 08:53:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:53:24,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159917294] [2022-04-08 08:53:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:53:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:53:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:53:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:25,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {142699#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {142692#true} is VALID [2022-04-08 08:53:25,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {142692#true} assume true; {142692#true} is VALID [2022-04-08 08:53:25,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142692#true} {142692#true} #708#return; {142692#true} is VALID [2022-04-08 08:53:25,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {142692#true} call ULTIMATE.init(); {142699#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:53:25,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {142699#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {142692#true} is VALID [2022-04-08 08:53:25,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {142692#true} assume true; {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142692#true} {142692#true} #708#return; {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {142692#true} call #t~ret161 := main(); {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {142692#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {142692#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L272 TraceCheckUtils]: 7: Hoare triple {142692#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {142692#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {142692#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {142692#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {142692#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {142692#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {142692#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {142692#true} assume !false; {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {142692#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {142692#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {142692#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {142692#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {142692#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {142692#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {142692#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {142692#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {142692#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {142692#true} assume 8464 == #t~mem55;havoc #t~mem55; {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {142692#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {142692#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {142692#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {142692#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {142692#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {142692#true} ~skip~0 := 0; {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {142692#true} assume !false; {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {142692#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {142692#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {142692#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {142692#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {142692#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {142692#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {142692#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {142692#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {142692#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {142692#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {142692#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {142692#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {142692#true} assume 8496 == #t~mem58;havoc #t~mem58; {142692#true} is VALID [2022-04-08 08:53:25,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {142692#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {142692#true} is VALID [2022-04-08 08:53:25,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {142692#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {142692#true} is VALID [2022-04-08 08:53:25,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {142692#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {142692#true} is VALID [2022-04-08 08:53:25,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {142692#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,070 INFO L290 TraceCheckUtils]: 58: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,071 INFO L290 TraceCheckUtils]: 63: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:25,073 INFO L290 TraceCheckUtils]: 67: Hoare triple {142697#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142698#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-08 08:53:25,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {142698#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {142693#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {142693#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {142693#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {142693#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,073 INFO L290 TraceCheckUtils]: 73: Hoare triple {142693#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,073 INFO L290 TraceCheckUtils]: 74: Hoare triple {142693#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 75: Hoare triple {142693#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 76: Hoare triple {142693#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 77: Hoare triple {142693#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 78: Hoare triple {142693#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 79: Hoare triple {142693#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 80: Hoare triple {142693#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 81: Hoare triple {142693#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 82: Hoare triple {142693#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 83: Hoare triple {142693#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,074 INFO L290 TraceCheckUtils]: 84: Hoare triple {142693#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 85: Hoare triple {142693#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 86: Hoare triple {142693#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 87: Hoare triple {142693#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 88: Hoare triple {142693#false} assume 8673 == #t~mem80;havoc #t~mem80; {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 89: Hoare triple {142693#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 90: Hoare triple {142693#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 91: Hoare triple {142693#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 92: Hoare triple {142693#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {142693#false} is VALID [2022-04-08 08:53:25,075 INFO L290 TraceCheckUtils]: 93: Hoare triple {142693#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 94: Hoare triple {142693#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 95: Hoare triple {142693#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 96: Hoare triple {142693#false} ~skip~0 := 0; {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 97: Hoare triple {142693#false} assume !false; {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 98: Hoare triple {142693#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 99: Hoare triple {142693#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 100: Hoare triple {142693#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 101: Hoare triple {142693#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 102: Hoare triple {142693#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 103: Hoare triple {142693#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,076 INFO L290 TraceCheckUtils]: 104: Hoare triple {142693#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 105: Hoare triple {142693#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 106: Hoare triple {142693#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 107: Hoare triple {142693#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 108: Hoare triple {142693#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 109: Hoare triple {142693#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 110: Hoare triple {142693#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 111: Hoare triple {142693#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 112: Hoare triple {142693#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 113: Hoare triple {142693#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,077 INFO L290 TraceCheckUtils]: 114: Hoare triple {142693#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 115: Hoare triple {142693#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 116: Hoare triple {142693#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 117: Hoare triple {142693#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 118: Hoare triple {142693#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 119: Hoare triple {142693#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 120: Hoare triple {142693#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 121: Hoare triple {142693#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 122: Hoare triple {142693#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 123: Hoare triple {142693#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 124: Hoare triple {142693#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,078 INFO L290 TraceCheckUtils]: 125: Hoare triple {142693#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,079 INFO L290 TraceCheckUtils]: 126: Hoare triple {142693#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {142693#false} is VALID [2022-04-08 08:53:25,079 INFO L290 TraceCheckUtils]: 127: Hoare triple {142693#false} assume 8640 == #t~mem75;havoc #t~mem75; {142693#false} is VALID [2022-04-08 08:53:25,079 INFO L290 TraceCheckUtils]: 128: Hoare triple {142693#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {142693#false} is VALID [2022-04-08 08:53:25,079 INFO L290 TraceCheckUtils]: 129: Hoare triple {142693#false} assume !(4 == ~blastFlag~0); {142693#false} is VALID [2022-04-08 08:53:25,079 INFO L290 TraceCheckUtils]: 130: Hoare triple {142693#false} assume !(7 == ~blastFlag~0); {142693#false} is VALID [2022-04-08 08:53:25,079 INFO L290 TraceCheckUtils]: 131: Hoare triple {142693#false} assume !(10 == ~blastFlag~0); {142693#false} is VALID [2022-04-08 08:53:25,079 INFO L290 TraceCheckUtils]: 132: Hoare triple {142693#false} assume 13 == ~blastFlag~0; {142693#false} is VALID [2022-04-08 08:53:25,079 INFO L290 TraceCheckUtils]: 133: Hoare triple {142693#false} assume !false; {142693#false} is VALID [2022-04-08 08:53:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 08:53:25,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:53:25,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159917294] [2022-04-08 08:53:25,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159917294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:25,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:25,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:25,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:53:25,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [401393611] [2022-04-08 08:53:25,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [401393611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:25,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:25,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:25,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592929813] [2022-04-08 08:53:25,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:53:25,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-08 08:53:25,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:53:25,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:25,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:25,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:53:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:53:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:53:25,156 INFO L87 Difference]: Start difference. First operand 1282 states and 2002 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:28,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:30,690 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-08 08:53:33,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:39,837 INFO L93 Difference]: Finished difference Result 2662 states and 4150 transitions. [2022-04-08 08:53:39,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:53:39,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-08 08:53:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:53:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-04-08 08:53:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-04-08 08:53:39,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 494 transitions. [2022-04-08 08:53:40,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:40,241 INFO L225 Difference]: With dead ends: 2662 [2022-04-08 08:53:40,241 INFO L226 Difference]: Without dead ends: 1406 [2022-04-08 08:53:40,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:53:40,243 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 34 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:53:40,243 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 623 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-04-08 08:53:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2022-04-08 08:53:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1354. [2022-04-08 08:53:40,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:53:40,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1406 states. Second operand has 1354 states, 1349 states have (on average 1.5611564121571535) internal successors, (2106), 1349 states have internal predecessors, (2106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:40,339 INFO L74 IsIncluded]: Start isIncluded. First operand 1406 states. Second operand has 1354 states, 1349 states have (on average 1.5611564121571535) internal successors, (2106), 1349 states have internal predecessors, (2106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:40,340 INFO L87 Difference]: Start difference. First operand 1406 states. Second operand has 1354 states, 1349 states have (on average 1.5611564121571535) internal successors, (2106), 1349 states have internal predecessors, (2106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:40,391 INFO L93 Difference]: Finished difference Result 1406 states and 2176 transitions. [2022-04-08 08:53:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2176 transitions. [2022-04-08 08:53:40,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:40,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:40,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 1354 states, 1349 states have (on average 1.5611564121571535) internal successors, (2106), 1349 states have internal predecessors, (2106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1406 states. [2022-04-08 08:53:40,394 INFO L87 Difference]: Start difference. First operand has 1354 states, 1349 states have (on average 1.5611564121571535) internal successors, (2106), 1349 states have internal predecessors, (2106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1406 states. [2022-04-08 08:53:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:40,442 INFO L93 Difference]: Finished difference Result 1406 states and 2176 transitions. [2022-04-08 08:53:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2176 transitions. [2022-04-08 08:53:40,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:40,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:40,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:53:40,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:53:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1349 states have (on average 1.5611564121571535) internal successors, (2106), 1349 states have internal predecessors, (2106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2110 transitions. [2022-04-08 08:53:40,522 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 2110 transitions. Word has length 134 [2022-04-08 08:53:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:53:40,522 INFO L478 AbstractCegarLoop]: Abstraction has 1354 states and 2110 transitions. [2022-04-08 08:53:40,523 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:40,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1354 states and 2110 transitions. [2022-04-08 08:53:45,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2110 edges. 2109 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2110 transitions. [2022-04-08 08:53:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-08 08:53:45,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:53:45,235 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:53:45,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-08 08:53:45,236 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:53:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:53:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash 403795998, now seen corresponding path program 1 times [2022-04-08 08:53:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:45,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389850089] [2022-04-08 08:53:45,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:53:45,320 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:53:45,320 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:53:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash 403795998, now seen corresponding path program 2 times [2022-04-08 08:53:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:53:45,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890108383] [2022-04-08 08:53:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:53:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:53:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:53:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:45,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {153555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {153548#true} is VALID [2022-04-08 08:53:45,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {153548#true} assume true; {153548#true} is VALID [2022-04-08 08:53:45,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {153548#true} {153548#true} #708#return; {153548#true} is VALID [2022-04-08 08:53:45,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {153548#true} call ULTIMATE.init(); {153555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:53:45,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {153555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {153548#true} is VALID [2022-04-08 08:53:45,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {153548#true} assume true; {153548#true} is VALID [2022-04-08 08:53:45,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153548#true} {153548#true} #708#return; {153548#true} is VALID [2022-04-08 08:53:45,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {153548#true} call #t~ret161 := main(); {153548#true} is VALID [2022-04-08 08:53:45,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {153548#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {153548#true} is VALID [2022-04-08 08:53:45,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {153548#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,590 INFO L272 TraceCheckUtils]: 7: Hoare triple {153548#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {153548#true} is VALID [2022-04-08 08:53:45,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {153548#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {153548#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {153548#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {153548#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {153548#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {153548#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {153548#true} assume !false; {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {153548#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {153548#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {153548#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {153548#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {153548#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {153548#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {153548#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {153548#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {153548#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {153548#true} assume 8464 == #t~mem55;havoc #t~mem55; {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {153548#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {153548#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {153548#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {153548#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {153548#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {153548#true} ~skip~0 := 0; {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {153548#true} assume !false; {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {153548#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {153548#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {153548#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {153548#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {153548#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {153548#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {153548#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {153548#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {153548#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {153548#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {153548#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {153548#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {153548#true} assume 8496 == #t~mem58;havoc #t~mem58; {153548#true} is VALID [2022-04-08 08:53:45,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {153548#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {153548#true} is VALID [2022-04-08 08:53:45,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {153548#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {153548#true} is VALID [2022-04-08 08:53:45,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {153548#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {153548#true} is VALID [2022-04-08 08:53:45,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {153548#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,601 INFO L290 TraceCheckUtils]: 60: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,603 INFO L290 TraceCheckUtils]: 64: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,603 INFO L290 TraceCheckUtils]: 65: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,603 INFO L290 TraceCheckUtils]: 66: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,604 INFO L290 TraceCheckUtils]: 67: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,604 INFO L290 TraceCheckUtils]: 68: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,605 INFO L290 TraceCheckUtils]: 69: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,605 INFO L290 TraceCheckUtils]: 70: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:45,607 INFO L290 TraceCheckUtils]: 73: Hoare triple {153553#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {153554#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-08 08:53:45,607 INFO L290 TraceCheckUtils]: 74: Hoare triple {153554#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {153549#false} is VALID [2022-04-08 08:53:45,607 INFO L290 TraceCheckUtils]: 75: Hoare triple {153549#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {153549#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 77: Hoare triple {153549#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 78: Hoare triple {153549#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 79: Hoare triple {153549#false} ~skip~0 := 0; {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 80: Hoare triple {153549#false} assume !false; {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {153549#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {153549#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 83: Hoare triple {153549#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 84: Hoare triple {153549#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,608 INFO L290 TraceCheckUtils]: 85: Hoare triple {153549#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 86: Hoare triple {153549#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 87: Hoare triple {153549#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 88: Hoare triple {153549#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 89: Hoare triple {153549#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 90: Hoare triple {153549#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 91: Hoare triple {153549#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 92: Hoare triple {153549#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 93: Hoare triple {153549#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 94: Hoare triple {153549#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 95: Hoare triple {153549#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,609 INFO L290 TraceCheckUtils]: 96: Hoare triple {153549#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 97: Hoare triple {153549#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 98: Hoare triple {153549#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 99: Hoare triple {153549#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 100: Hoare triple {153549#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 101: Hoare triple {153549#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 102: Hoare triple {153549#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 103: Hoare triple {153549#false} assume 8448 == #t~mem68;havoc #t~mem68; {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 104: Hoare triple {153549#false} assume !(~num1~0 > 0); {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 105: Hoare triple {153549#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {153549#false} is VALID [2022-04-08 08:53:45,610 INFO L290 TraceCheckUtils]: 106: Hoare triple {153549#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 107: Hoare triple {153549#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 108: Hoare triple {153549#false} ~skip~0 := 0; {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 109: Hoare triple {153549#false} assume !false; {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 110: Hoare triple {153549#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 111: Hoare triple {153549#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 112: Hoare triple {153549#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 113: Hoare triple {153549#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 114: Hoare triple {153549#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 115: Hoare triple {153549#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 116: Hoare triple {153549#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,611 INFO L290 TraceCheckUtils]: 117: Hoare triple {153549#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 118: Hoare triple {153549#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 119: Hoare triple {153549#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 120: Hoare triple {153549#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 121: Hoare triple {153549#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 122: Hoare triple {153549#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 123: Hoare triple {153549#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 124: Hoare triple {153549#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 125: Hoare triple {153549#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 126: Hoare triple {153549#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,612 INFO L290 TraceCheckUtils]: 127: Hoare triple {153549#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 128: Hoare triple {153549#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 129: Hoare triple {153549#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 130: Hoare triple {153549#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 131: Hoare triple {153549#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 132: Hoare triple {153549#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 133: Hoare triple {153549#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 134: Hoare triple {153549#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 135: Hoare triple {153549#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 136: Hoare triple {153549#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 137: Hoare triple {153549#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,613 INFO L290 TraceCheckUtils]: 138: Hoare triple {153549#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {153549#false} is VALID [2022-04-08 08:53:45,614 INFO L290 TraceCheckUtils]: 139: Hoare triple {153549#false} assume 8640 == #t~mem75;havoc #t~mem75; {153549#false} is VALID [2022-04-08 08:53:45,614 INFO L290 TraceCheckUtils]: 140: Hoare triple {153549#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {153549#false} is VALID [2022-04-08 08:53:45,614 INFO L290 TraceCheckUtils]: 141: Hoare triple {153549#false} assume !(4 == ~blastFlag~0); {153549#false} is VALID [2022-04-08 08:53:45,614 INFO L290 TraceCheckUtils]: 142: Hoare triple {153549#false} assume !(7 == ~blastFlag~0); {153549#false} is VALID [2022-04-08 08:53:45,614 INFO L290 TraceCheckUtils]: 143: Hoare triple {153549#false} assume !(10 == ~blastFlag~0); {153549#false} is VALID [2022-04-08 08:53:45,614 INFO L290 TraceCheckUtils]: 144: Hoare triple {153549#false} assume 13 == ~blastFlag~0; {153549#false} is VALID [2022-04-08 08:53:45,614 INFO L290 TraceCheckUtils]: 145: Hoare triple {153549#false} assume !false; {153549#false} is VALID [2022-04-08 08:53:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:53:45,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:53:45,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890108383] [2022-04-08 08:53:45,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890108383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:45,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:45,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:45,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:53:45,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389850089] [2022-04-08 08:53:45,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389850089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:45,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:45,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:45,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121271963] [2022-04-08 08:53:45,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:53:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-08 08:53:45,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:53:45,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:45,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:45,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:53:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:53:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:53:45,698 INFO L87 Difference]: Start difference. First operand 1354 states and 2110 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:48,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:53,219 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-08 08:53:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:58,935 INFO L93 Difference]: Finished difference Result 3028 states and 4691 transitions. [2022-04-08 08:53:58,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:53:58,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-08 08:53:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:53:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:53:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:53:58,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 607 transitions. [2022-04-08 08:53:59,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:59,486 INFO L225 Difference]: With dead ends: 3028 [2022-04-08 08:53:59,486 INFO L226 Difference]: Without dead ends: 1700 [2022-04-08 08:53:59,488 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:53:59,494 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 129 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:53:59,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 378 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-08 08:53:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2022-04-08 08:53:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1444. [2022-04-08 08:53:59,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:53:59,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1700 states. Second operand has 1444 states, 1439 states have (on average 1.5510771369006255) internal successors, (2232), 1439 states have internal predecessors, (2232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:59,601 INFO L74 IsIncluded]: Start isIncluded. First operand 1700 states. Second operand has 1444 states, 1439 states have (on average 1.5510771369006255) internal successors, (2232), 1439 states have internal predecessors, (2232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:59,601 INFO L87 Difference]: Start difference. First operand 1700 states. Second operand has 1444 states, 1439 states have (on average 1.5510771369006255) internal successors, (2232), 1439 states have internal predecessors, (2232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:59,682 INFO L93 Difference]: Finished difference Result 1700 states and 2591 transitions. [2022-04-08 08:53:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2591 transitions. [2022-04-08 08:53:59,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:59,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:59,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 1444 states, 1439 states have (on average 1.5510771369006255) internal successors, (2232), 1439 states have internal predecessors, (2232), 3 states have call successors, (3), 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 1700 states. [2022-04-08 08:53:59,685 INFO L87 Difference]: Start difference. First operand has 1444 states, 1439 states have (on average 1.5510771369006255) internal successors, (2232), 1439 states have internal predecessors, (2232), 3 states have call successors, (3), 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 1700 states. [2022-04-08 08:53:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:59,773 INFO L93 Difference]: Finished difference Result 1700 states and 2591 transitions. [2022-04-08 08:53:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2591 transitions. [2022-04-08 08:53:59,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:59,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:59,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:53:59,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:53:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1439 states have (on average 1.5510771369006255) internal successors, (2232), 1439 states have internal predecessors, (2232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2236 transitions. [2022-04-08 08:53:59,852 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2236 transitions. Word has length 146 [2022-04-08 08:53:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:53:59,852 INFO L478 AbstractCegarLoop]: Abstraction has 1444 states and 2236 transitions. [2022-04-08 08:53:59,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:59,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1444 states and 2236 transitions. [2022-04-08 08:54:04,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2236 edges. 2235 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2236 transitions. [2022-04-08 08:54:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-08 08:54:04,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:54:04,704 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:54:04,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-08 08:54:04,705 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:54:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:54:04,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1964705935, now seen corresponding path program 1 times [2022-04-08 08:54:04,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:04,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [782405845] [2022-04-08 08:54:04,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:54:04,780 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:54:04,780 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:54:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1964705935, now seen corresponding path program 2 times [2022-04-08 08:54:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:54:04,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775141861] [2022-04-08 08:54:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:54:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:54:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:54:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:04,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {165911#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165904#true} is VALID [2022-04-08 08:54:04,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {165904#true} assume true; {165904#true} is VALID [2022-04-08 08:54:04,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165904#true} {165904#true} #708#return; {165904#true} is VALID [2022-04-08 08:54:04,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {165904#true} call ULTIMATE.init(); {165911#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:54:04,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {165911#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165904#true} is VALID [2022-04-08 08:54:04,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {165904#true} assume true; {165904#true} is VALID [2022-04-08 08:54:04,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165904#true} {165904#true} #708#return; {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {165904#true} call #t~ret161 := main(); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {165904#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {165904#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L272 TraceCheckUtils]: 7: Hoare triple {165904#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {165904#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {165904#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {165904#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {165904#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {165904#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {165904#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {165904#true} assume !false; {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {165904#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {165904#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {165904#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {165904#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {165904#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {165904#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {165904#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {165904#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {165904#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {165904#true} assume 8464 == #t~mem55;havoc #t~mem55; {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {165904#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {165904#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {165904#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {165904#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {165904#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {165904#true} ~skip~0 := 0; {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {165904#true} assume !false; {165904#true} is VALID [2022-04-08 08:54:04,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {165904#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {165904#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {165904#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {165904#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {165904#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {165904#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {165904#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {165904#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {165904#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {165904#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {165904#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {165904#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {165904#true} assume 8496 == #t~mem58;havoc #t~mem58; {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {165904#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {165904#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {165904#true} is VALID [2022-04-08 08:54:05,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {165904#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {165904#true} is VALID [2022-04-08 08:54:05,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {165904#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,003 INFO L290 TraceCheckUtils]: 51: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,003 INFO L290 TraceCheckUtils]: 52: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,004 INFO L290 TraceCheckUtils]: 54: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,004 INFO L290 TraceCheckUtils]: 55: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,005 INFO L290 TraceCheckUtils]: 57: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,005 INFO L290 TraceCheckUtils]: 58: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,008 INFO L290 TraceCheckUtils]: 67: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,009 INFO L290 TraceCheckUtils]: 68: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,009 INFO L290 TraceCheckUtils]: 70: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,010 INFO L290 TraceCheckUtils]: 71: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,010 INFO L290 TraceCheckUtils]: 72: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:05,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {165909#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {165910#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-08 08:54:05,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {165910#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {165905#false} is VALID [2022-04-08 08:54:05,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {165905#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {165905#false} is VALID [2022-04-08 08:54:05,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {165905#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,011 INFO L290 TraceCheckUtils]: 78: Hoare triple {165905#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,011 INFO L290 TraceCheckUtils]: 79: Hoare triple {165905#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {165905#false} is VALID [2022-04-08 08:54:05,011 INFO L290 TraceCheckUtils]: 80: Hoare triple {165905#false} ~skip~0 := 0; {165905#false} is VALID [2022-04-08 08:54:05,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {165905#false} assume !false; {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 82: Hoare triple {165905#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 83: Hoare triple {165905#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 84: Hoare triple {165905#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 85: Hoare triple {165905#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 86: Hoare triple {165905#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 87: Hoare triple {165905#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 88: Hoare triple {165905#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 89: Hoare triple {165905#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 90: Hoare triple {165905#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 91: Hoare triple {165905#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 92: Hoare triple {165905#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 93: Hoare triple {165905#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 94: Hoare triple {165905#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 95: Hoare triple {165905#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,012 INFO L290 TraceCheckUtils]: 96: Hoare triple {165905#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 97: Hoare triple {165905#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 98: Hoare triple {165905#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 99: Hoare triple {165905#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 100: Hoare triple {165905#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 101: Hoare triple {165905#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 102: Hoare triple {165905#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 103: Hoare triple {165905#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 104: Hoare triple {165905#false} assume 8448 == #t~mem68;havoc #t~mem68; {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 105: Hoare triple {165905#false} assume !(~num1~0 > 0); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 106: Hoare triple {165905#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 107: Hoare triple {165905#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 108: Hoare triple {165905#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 109: Hoare triple {165905#false} ~skip~0 := 0; {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 110: Hoare triple {165905#false} assume !false; {165905#false} is VALID [2022-04-08 08:54:05,013 INFO L290 TraceCheckUtils]: 111: Hoare triple {165905#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 112: Hoare triple {165905#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 113: Hoare triple {165905#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 114: Hoare triple {165905#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 115: Hoare triple {165905#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 116: Hoare triple {165905#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 117: Hoare triple {165905#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 118: Hoare triple {165905#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 119: Hoare triple {165905#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 120: Hoare triple {165905#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 121: Hoare triple {165905#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 122: Hoare triple {165905#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 123: Hoare triple {165905#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 124: Hoare triple {165905#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 125: Hoare triple {165905#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,014 INFO L290 TraceCheckUtils]: 126: Hoare triple {165905#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 127: Hoare triple {165905#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 128: Hoare triple {165905#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 129: Hoare triple {165905#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 130: Hoare triple {165905#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 131: Hoare triple {165905#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 132: Hoare triple {165905#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 133: Hoare triple {165905#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 134: Hoare triple {165905#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 135: Hoare triple {165905#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 136: Hoare triple {165905#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 137: Hoare triple {165905#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 138: Hoare triple {165905#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 139: Hoare triple {165905#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {165905#false} is VALID [2022-04-08 08:54:05,015 INFO L290 TraceCheckUtils]: 140: Hoare triple {165905#false} assume 8640 == #t~mem75;havoc #t~mem75; {165905#false} is VALID [2022-04-08 08:54:05,016 INFO L290 TraceCheckUtils]: 141: Hoare triple {165905#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {165905#false} is VALID [2022-04-08 08:54:05,016 INFO L290 TraceCheckUtils]: 142: Hoare triple {165905#false} assume !(4 == ~blastFlag~0); {165905#false} is VALID [2022-04-08 08:54:05,016 INFO L290 TraceCheckUtils]: 143: Hoare triple {165905#false} assume !(7 == ~blastFlag~0); {165905#false} is VALID [2022-04-08 08:54:05,016 INFO L290 TraceCheckUtils]: 144: Hoare triple {165905#false} assume !(10 == ~blastFlag~0); {165905#false} is VALID [2022-04-08 08:54:05,016 INFO L290 TraceCheckUtils]: 145: Hoare triple {165905#false} assume 13 == ~blastFlag~0; {165905#false} is VALID [2022-04-08 08:54:05,016 INFO L290 TraceCheckUtils]: 146: Hoare triple {165905#false} assume !false; {165905#false} is VALID [2022-04-08 08:54:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:54:05,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:54:05,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775141861] [2022-04-08 08:54:05,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775141861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:05,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:05,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:05,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:54:05,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [782405845] [2022-04-08 08:54:05,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [782405845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:05,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:05,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306227440] [2022-04-08 08:54:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:54:05,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-08 08:54:05,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:54:05,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:05,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:05,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:54:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:05,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:54:05,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:54:05,091 INFO L87 Difference]: Start difference. First operand 1444 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:09,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:22,066 INFO L93 Difference]: Finished difference Result 3079 states and 4736 transitions. [2022-04-08 08:54:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:54:22,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-08 08:54:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:54:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:54:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:54:22,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 607 transitions. [2022-04-08 08:54:22,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:22,607 INFO L225 Difference]: With dead ends: 3079 [2022-04-08 08:54:22,607 INFO L226 Difference]: Without dead ends: 1661 [2022-04-08 08:54:22,608 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:54:22,608 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 128 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:54:22,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 378 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-08 08:54:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2022-04-08 08:54:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1444. [2022-04-08 08:54:22,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:54:22,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1661 states. Second operand has 1444 states, 1439 states have (on average 1.5364836692147326) internal successors, (2211), 1439 states have internal predecessors, (2211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:22,730 INFO L74 IsIncluded]: Start isIncluded. First operand 1661 states. Second operand has 1444 states, 1439 states have (on average 1.5364836692147326) internal successors, (2211), 1439 states have internal predecessors, (2211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:22,731 INFO L87 Difference]: Start difference. First operand 1661 states. Second operand has 1444 states, 1439 states have (on average 1.5364836692147326) internal successors, (2211), 1439 states have internal predecessors, (2211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:22,808 INFO L93 Difference]: Finished difference Result 1661 states and 2510 transitions. [2022-04-08 08:54:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2510 transitions. [2022-04-08 08:54:22,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:22,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:22,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 1444 states, 1439 states have (on average 1.5364836692147326) internal successors, (2211), 1439 states have internal predecessors, (2211), 3 states have call successors, (3), 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 1661 states. [2022-04-08 08:54:22,811 INFO L87 Difference]: Start difference. First operand has 1444 states, 1439 states have (on average 1.5364836692147326) internal successors, (2211), 1439 states have internal predecessors, (2211), 3 states have call successors, (3), 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 1661 states. [2022-04-08 08:54:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:22,886 INFO L93 Difference]: Finished difference Result 1661 states and 2510 transitions. [2022-04-08 08:54:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2510 transitions. [2022-04-08 08:54:22,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:22,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:22,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:54:22,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:54:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1439 states have (on average 1.5364836692147326) internal successors, (2211), 1439 states have internal predecessors, (2211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2215 transitions. [2022-04-08 08:54:22,978 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2215 transitions. Word has length 147 [2022-04-08 08:54:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:54:22,978 INFO L478 AbstractCegarLoop]: Abstraction has 1444 states and 2215 transitions. [2022-04-08 08:54:22,978 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:22,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1444 states and 2215 transitions. [2022-04-08 08:54:27,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2215 edges. 2214 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2215 transitions. [2022-04-08 08:54:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-08 08:54:27,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:54:27,869 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:54:27,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-08 08:54:27,870 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:54:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:54:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1409085819, now seen corresponding path program 1 times [2022-04-08 08:54:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:27,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691733097] [2022-04-08 08:54:27,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:54:27,965 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:54:27,965 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:54:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1409085819, now seen corresponding path program 2 times [2022-04-08 08:54:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:54:27,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325027764] [2022-04-08 08:54:27,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:54:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:54:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:54:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:28,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {178291#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {178284#true} is VALID [2022-04-08 08:54:28,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {178284#true} assume true; {178284#true} is VALID [2022-04-08 08:54:28,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178284#true} {178284#true} #708#return; {178284#true} is VALID [2022-04-08 08:54:28,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {178284#true} call ULTIMATE.init(); {178291#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:54:28,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {178291#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {178284#true} assume true; {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178284#true} {178284#true} #708#return; {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {178284#true} call #t~ret161 := main(); {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {178284#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {178284#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L272 TraceCheckUtils]: 7: Hoare triple {178284#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {178284#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {178284#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {178284#true} is VALID [2022-04-08 08:54:28,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {178284#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {178284#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {178284#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {178284#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {178284#true} assume !false; {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {178284#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {178284#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {178284#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {178284#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {178284#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {178284#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {178284#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {178284#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {178284#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {178284#true} assume 8464 == #t~mem55;havoc #t~mem55; {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {178284#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {178284#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {178284#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {178284#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {178284#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {178284#true} ~skip~0 := 0; {178284#true} is VALID [2022-04-08 08:54:28,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {178284#true} assume !false; {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {178284#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {178284#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {178284#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {178284#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {178284#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {178284#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {178284#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {178284#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {178284#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {178284#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {178284#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,229 INFO L290 TraceCheckUtils]: 43: Hoare triple {178284#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {178284#true} assume 8496 == #t~mem58;havoc #t~mem58; {178284#true} is VALID [2022-04-08 08:54:28,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {178284#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {178284#true} is VALID [2022-04-08 08:54:28,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {178284#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {178284#true} is VALID [2022-04-08 08:54:28,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {178284#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {178284#true} is VALID [2022-04-08 08:54:28,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {178284#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:28,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {178289#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {178290#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-08 08:54:28,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {178290#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {178285#false} is VALID [2022-04-08 08:54:28,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {178285#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {178285#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {178285#false} is VALID [2022-04-08 08:54:28,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {178285#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {178285#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {178285#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {178285#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {178285#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 66: Hoare triple {178285#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {178285#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {178285#false} ~skip~0 := 0; {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {178285#false} assume !false; {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {178285#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {178285#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {178285#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {178285#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {178285#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {178285#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {178285#false} assume 8480 == #t~mem52;havoc #t~mem52; {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {178285#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {178285#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {178285#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {178285#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 81: Hoare triple {178285#false} ~skip~0 := 0; {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 82: Hoare triple {178285#false} assume !false; {178285#false} is VALID [2022-04-08 08:54:28,237 INFO L290 TraceCheckUtils]: 83: Hoare triple {178285#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 84: Hoare triple {178285#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 85: Hoare triple {178285#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 86: Hoare triple {178285#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 87: Hoare triple {178285#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 88: Hoare triple {178285#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 89: Hoare triple {178285#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 90: Hoare triple {178285#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 91: Hoare triple {178285#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 92: Hoare triple {178285#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,238 INFO L290 TraceCheckUtils]: 93: Hoare triple {178285#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 94: Hoare triple {178285#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 95: Hoare triple {178285#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {178285#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 97: Hoare triple {178285#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 98: Hoare triple {178285#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 99: Hoare triple {178285#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 100: Hoare triple {178285#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 101: Hoare triple {178285#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 102: Hoare triple {178285#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 103: Hoare triple {178285#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,239 INFO L290 TraceCheckUtils]: 104: Hoare triple {178285#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 105: Hoare triple {178285#false} assume 8448 == #t~mem68;havoc #t~mem68; {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 106: Hoare triple {178285#false} assume !(~num1~0 > 0); {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 107: Hoare triple {178285#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 108: Hoare triple {178285#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 109: Hoare triple {178285#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 110: Hoare triple {178285#false} ~skip~0 := 0; {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 111: Hoare triple {178285#false} assume !false; {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 112: Hoare triple {178285#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 113: Hoare triple {178285#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 114: Hoare triple {178285#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,240 INFO L290 TraceCheckUtils]: 115: Hoare triple {178285#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 116: Hoare triple {178285#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 117: Hoare triple {178285#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 118: Hoare triple {178285#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 119: Hoare triple {178285#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 120: Hoare triple {178285#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 121: Hoare triple {178285#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 122: Hoare triple {178285#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 123: Hoare triple {178285#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 124: Hoare triple {178285#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 125: Hoare triple {178285#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,241 INFO L290 TraceCheckUtils]: 126: Hoare triple {178285#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 127: Hoare triple {178285#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 128: Hoare triple {178285#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 129: Hoare triple {178285#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 130: Hoare triple {178285#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 131: Hoare triple {178285#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 132: Hoare triple {178285#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 133: Hoare triple {178285#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 134: Hoare triple {178285#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 135: Hoare triple {178285#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 136: Hoare triple {178285#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,242 INFO L290 TraceCheckUtils]: 137: Hoare triple {178285#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 138: Hoare triple {178285#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 139: Hoare triple {178285#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 140: Hoare triple {178285#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 141: Hoare triple {178285#false} assume 8640 == #t~mem75;havoc #t~mem75; {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 142: Hoare triple {178285#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 143: Hoare triple {178285#false} assume !(4 == ~blastFlag~0); {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 144: Hoare triple {178285#false} assume !(7 == ~blastFlag~0); {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 145: Hoare triple {178285#false} assume !(10 == ~blastFlag~0); {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 146: Hoare triple {178285#false} assume 13 == ~blastFlag~0; {178285#false} is VALID [2022-04-08 08:54:28,243 INFO L290 TraceCheckUtils]: 147: Hoare triple {178285#false} assume !false; {178285#false} is VALID [2022-04-08 08:54:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 08:54:28,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:54:28,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325027764] [2022-04-08 08:54:28,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325027764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:28,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:28,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:28,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:54:28,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691733097] [2022-04-08 08:54:28,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691733097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:28,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:28,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117414985] [2022-04-08 08:54:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:54:28,245 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 148 [2022-04-08 08:54:28,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:54:28,246 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-08 08:54:28,332 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-08 08:54:28,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:54:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:54:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:54:28,333 INFO L87 Difference]: Start difference. First operand 1444 states and 2215 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-08 08:54:32,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:43,708 INFO L93 Difference]: Finished difference Result 2621 states and 3989 transitions. [2022-04-08 08:54:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:54:43,709 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 148 [2022-04-08 08:54:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:54:43,709 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-08 08:54:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 08:54:43,711 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-08 08:54:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 08:54:43,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-08 08:54:44,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:44,241 INFO L225 Difference]: With dead ends: 2621 [2022-04-08 08:54:44,241 INFO L226 Difference]: Without dead ends: 1641 [2022-04-08 08:54:44,242 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:54:44,242 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 137 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:54:44,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 388 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 08:54:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-04-08 08:54:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1444. [2022-04-08 08:54:44,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:54:44,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1641 states. Second operand has 1444 states, 1439 states have (on average 1.516330785267547) internal successors, (2182), 1439 states have internal predecessors, (2182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:44,359 INFO L74 IsIncluded]: Start isIncluded. First operand 1641 states. Second operand has 1444 states, 1439 states have (on average 1.516330785267547) internal successors, (2182), 1439 states have internal predecessors, (2182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:44,359 INFO L87 Difference]: Start difference. First operand 1641 states. Second operand has 1444 states, 1439 states have (on average 1.516330785267547) internal successors, (2182), 1439 states have internal predecessors, (2182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:44,429 INFO L93 Difference]: Finished difference Result 1641 states and 2455 transitions. [2022-04-08 08:54:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2455 transitions. [2022-04-08 08:54:44,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:44,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:44,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 1444 states, 1439 states have (on average 1.516330785267547) internal successors, (2182), 1439 states have internal predecessors, (2182), 3 states have call successors, (3), 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 1641 states. [2022-04-08 08:54:44,432 INFO L87 Difference]: Start difference. First operand has 1444 states, 1439 states have (on average 1.516330785267547) internal successors, (2182), 1439 states have internal predecessors, (2182), 3 states have call successors, (3), 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 1641 states. [2022-04-08 08:54:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:44,522 INFO L93 Difference]: Finished difference Result 1641 states and 2455 transitions. [2022-04-08 08:54:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2455 transitions. [2022-04-08 08:54:44,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:44,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:44,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:54:44,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:54:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1439 states have (on average 1.516330785267547) internal successors, (2182), 1439 states have internal predecessors, (2182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2186 transitions. [2022-04-08 08:54:44,599 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2186 transitions. Word has length 148 [2022-04-08 08:54:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:54:44,599 INFO L478 AbstractCegarLoop]: Abstraction has 1444 states and 2186 transitions. [2022-04-08 08:54:44,599 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-08 08:54:44,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1444 states and 2186 transitions. [2022-04-08 08:54:49,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2186 edges. 2185 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2186 transitions. [2022-04-08 08:54:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-08 08:54:49,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:54:49,576 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:54:49,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-08 08:54:49,576 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:54:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:54:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2042364623, now seen corresponding path program 1 times [2022-04-08 08:54:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:49,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [458642847] [2022-04-08 08:54:49,662 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:54:49,662 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:54:49,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:54:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2042364623, now seen corresponding path program 2 times [2022-04-08 08:54:49,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:54:49,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378091900] [2022-04-08 08:54:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:54:49,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:54:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:49,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:54:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:49,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {189715#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {189708#true} is VALID [2022-04-08 08:54:49,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {189708#true} assume true; {189708#true} is VALID [2022-04-08 08:54:49,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {189708#true} {189708#true} #708#return; {189708#true} is VALID [2022-04-08 08:54:49,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {189708#true} call ULTIMATE.init(); {189715#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:54:49,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {189715#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {189708#true} is VALID [2022-04-08 08:54:49,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {189708#true} assume true; {189708#true} is VALID [2022-04-08 08:54:49,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189708#true} {189708#true} #708#return; {189708#true} is VALID [2022-04-08 08:54:49,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {189708#true} call #t~ret161 := main(); {189708#true} is VALID [2022-04-08 08:54:49,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {189708#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {189708#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L272 TraceCheckUtils]: 7: Hoare triple {189708#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {189708#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {189708#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {189708#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {189708#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {189708#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {189708#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {189708#true} assume !false; {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {189708#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {189708#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {189708#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {189708#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {189708#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {189708#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {189708#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {189708#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {189708#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {189708#true} assume 8464 == #t~mem55;havoc #t~mem55; {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {189708#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {189708#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {189708#true} is VALID [2022-04-08 08:54:49,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {189708#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {189708#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {189708#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {189708#true} ~skip~0 := 0; {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {189708#true} assume !false; {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {189708#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {189708#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {189708#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {189708#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {189708#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {189708#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {189708#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {189708#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {189708#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {189708#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {189708#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {189708#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {189708#true} assume 8496 == #t~mem58;havoc #t~mem58; {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {189708#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {189708#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {189708#true} is VALID [2022-04-08 08:54:49,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {189708#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {189708#true} is VALID [2022-04-08 08:54:49,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {189708#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,912 INFO L290 TraceCheckUtils]: 58: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,912 INFO L290 TraceCheckUtils]: 59: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:49,914 INFO L290 TraceCheckUtils]: 61: Hoare triple {189713#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {189714#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:54:49,914 INFO L290 TraceCheckUtils]: 62: Hoare triple {189714#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {189709#false} is VALID [2022-04-08 08:54:49,914 INFO L290 TraceCheckUtils]: 63: Hoare triple {189709#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,914 INFO L290 TraceCheckUtils]: 64: Hoare triple {189709#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,914 INFO L290 TraceCheckUtils]: 65: Hoare triple {189709#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {189709#false} is VALID [2022-04-08 08:54:49,914 INFO L290 TraceCheckUtils]: 66: Hoare triple {189709#false} ~skip~0 := 0; {189709#false} is VALID [2022-04-08 08:54:49,914 INFO L290 TraceCheckUtils]: 67: Hoare triple {189709#false} assume !false; {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 68: Hoare triple {189709#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 69: Hoare triple {189709#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 70: Hoare triple {189709#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 71: Hoare triple {189709#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 72: Hoare triple {189709#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 73: Hoare triple {189709#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 74: Hoare triple {189709#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 75: Hoare triple {189709#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 76: Hoare triple {189709#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,915 INFO L290 TraceCheckUtils]: 77: Hoare triple {189709#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 78: Hoare triple {189709#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 79: Hoare triple {189709#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 80: Hoare triple {189709#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 81: Hoare triple {189709#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 82: Hoare triple {189709#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 83: Hoare triple {189709#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 84: Hoare triple {189709#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 85: Hoare triple {189709#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 86: Hoare triple {189709#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,916 INFO L290 TraceCheckUtils]: 87: Hoare triple {189709#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 88: Hoare triple {189709#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 89: Hoare triple {189709#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 90: Hoare triple {189709#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 91: Hoare triple {189709#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 92: Hoare triple {189709#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 93: Hoare triple {189709#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 94: Hoare triple {189709#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 95: Hoare triple {189709#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 96: Hoare triple {189709#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,917 INFO L290 TraceCheckUtils]: 97: Hoare triple {189709#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 98: Hoare triple {189709#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 99: Hoare triple {189709#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 100: Hoare triple {189709#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 101: Hoare triple {189709#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 102: Hoare triple {189709#false} assume 8673 == #t~mem80;havoc #t~mem80; {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 103: Hoare triple {189709#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 104: Hoare triple {189709#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 105: Hoare triple {189709#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 106: Hoare triple {189709#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 107: Hoare triple {189709#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,918 INFO L290 TraceCheckUtils]: 108: Hoare triple {189709#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 109: Hoare triple {189709#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 110: Hoare triple {189709#false} ~skip~0 := 0; {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 111: Hoare triple {189709#false} assume !false; {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 112: Hoare triple {189709#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 113: Hoare triple {189709#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 114: Hoare triple {189709#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 115: Hoare triple {189709#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 116: Hoare triple {189709#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 117: Hoare triple {189709#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,919 INFO L290 TraceCheckUtils]: 118: Hoare triple {189709#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 119: Hoare triple {189709#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 120: Hoare triple {189709#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 121: Hoare triple {189709#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 122: Hoare triple {189709#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 123: Hoare triple {189709#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 124: Hoare triple {189709#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 125: Hoare triple {189709#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 126: Hoare triple {189709#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 127: Hoare triple {189709#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 128: Hoare triple {189709#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,920 INFO L290 TraceCheckUtils]: 129: Hoare triple {189709#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 130: Hoare triple {189709#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 131: Hoare triple {189709#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 132: Hoare triple {189709#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 133: Hoare triple {189709#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 134: Hoare triple {189709#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 135: Hoare triple {189709#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 136: Hoare triple {189709#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 137: Hoare triple {189709#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 138: Hoare triple {189709#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 139: Hoare triple {189709#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,921 INFO L290 TraceCheckUtils]: 140: Hoare triple {189709#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {189709#false} is VALID [2022-04-08 08:54:49,922 INFO L290 TraceCheckUtils]: 141: Hoare triple {189709#false} assume 8640 == #t~mem75;havoc #t~mem75; {189709#false} is VALID [2022-04-08 08:54:49,922 INFO L290 TraceCheckUtils]: 142: Hoare triple {189709#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {189709#false} is VALID [2022-04-08 08:54:49,922 INFO L290 TraceCheckUtils]: 143: Hoare triple {189709#false} assume !(4 == ~blastFlag~0); {189709#false} is VALID [2022-04-08 08:54:49,922 INFO L290 TraceCheckUtils]: 144: Hoare triple {189709#false} assume !(7 == ~blastFlag~0); {189709#false} is VALID [2022-04-08 08:54:49,922 INFO L290 TraceCheckUtils]: 145: Hoare triple {189709#false} assume !(10 == ~blastFlag~0); {189709#false} is VALID [2022-04-08 08:54:49,922 INFO L290 TraceCheckUtils]: 146: Hoare triple {189709#false} assume 13 == ~blastFlag~0; {189709#false} is VALID [2022-04-08 08:54:49,922 INFO L290 TraceCheckUtils]: 147: Hoare triple {189709#false} assume !false; {189709#false} is VALID [2022-04-08 08:54:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 08:54:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:54:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378091900] [2022-04-08 08:54:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378091900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:49,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:49,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:49,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:54:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [458642847] [2022-04-08 08:54:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [458642847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:49,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:49,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914816469] [2022-04-08 08:54:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:54:49,924 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 148 [2022-04-08 08:54:49,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:54:49,924 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-08 08:54:50,010 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-08 08:54:50,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:54:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:54:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:54:50,011 INFO L87 Difference]: Start difference. First operand 1444 states and 2186 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-08 08:54:52,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:57,528 INFO L93 Difference]: Finished difference Result 2013 states and 3047 transitions. [2022-04-08 08:54:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:54:57,529 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 148 [2022-04-08 08:54:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:54:57,529 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-08 08:54:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:54:57,531 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-08 08:54:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:54:57,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-08 08:54:57,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:57,941 INFO L225 Difference]: With dead ends: 2013 [2022-04-08 08:54:57,941 INFO L226 Difference]: Without dead ends: 595 [2022-04-08 08:54:57,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:54:57,942 INFO L913 BasicCegarLoop]: 151 mSDtfsCounter, 132 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:54:57,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 418 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 480 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:54:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-08 08:54:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 527. [2022-04-08 08:54:57,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:54:57,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 527 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 522 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:57,973 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 527 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 522 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:57,973 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 527 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 522 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:57,983 INFO L93 Difference]: Finished difference Result 595 states and 882 transitions. [2022-04-08 08:54:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 882 transitions. [2022-04-08 08:54:57,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:57,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:57,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 527 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 522 states have internal predecessors, (780), 3 states have call successors, (3), 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 595 states. [2022-04-08 08:54:57,984 INFO L87 Difference]: Start difference. First operand has 527 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 522 states have internal predecessors, (780), 3 states have call successors, (3), 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 595 states. [2022-04-08 08:54:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:57,995 INFO L93 Difference]: Finished difference Result 595 states and 882 transitions. [2022-04-08 08:54:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 882 transitions. [2022-04-08 08:54:57,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:57,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:57,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:54:57,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:54:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 522 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 784 transitions. [2022-04-08 08:54:58,006 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 784 transitions. Word has length 148 [2022-04-08 08:54:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:54:58,006 INFO L478 AbstractCegarLoop]: Abstraction has 527 states and 784 transitions. [2022-04-08 08:54:58,007 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-08 08:54:58,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 527 states and 784 transitions. [2022-04-08 08:54:58,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 784 edges. 784 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 784 transitions. [2022-04-08 08:54:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-08 08:54:58,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:54:58,777 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:54:58,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-08 08:54:58,777 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:54:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:54:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash -979936917, now seen corresponding path program 1 times [2022-04-08 08:54:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:58,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412741043] [2022-04-08 08:54:58,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:54:58,869 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:54:58,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:54:58,869 INFO L85 PathProgramCache]: Analyzing trace with hash -979936917, now seen corresponding path program 2 times [2022-04-08 08:54:58,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:54:58,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259637053] [2022-04-08 08:54:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:54:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:54:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:54:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:59,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {195997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {195990#true} is VALID [2022-04-08 08:54:59,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {195990#true} assume true; {195990#true} is VALID [2022-04-08 08:54:59,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {195990#true} {195990#true} #708#return; {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {195990#true} call ULTIMATE.init(); {195997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:54:59,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {195997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {195990#true} assume true; {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195990#true} {195990#true} #708#return; {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {195990#true} call #t~ret161 := main(); {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {195990#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {195990#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L272 TraceCheckUtils]: 7: Hoare triple {195990#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {195990#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {195990#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {195990#true} is VALID [2022-04-08 08:54:59,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {195990#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {195990#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {195990#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {195990#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {195990#true} assume !false; {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {195990#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {195990#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {195990#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {195990#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {195990#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {195990#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {195990#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {195990#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {195990#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {195990#true} assume 8464 == #t~mem55;havoc #t~mem55; {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {195990#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {195990#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {195990#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {195990#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {195990#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {195990#true} ~skip~0 := 0; {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {195990#true} assume !false; {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {195990#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {195990#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {195990#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {195990#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {195990#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {195990#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {195990#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {195990#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {195990#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {195990#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {195990#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {195990#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {195990#true} assume 8496 == #t~mem58;havoc #t~mem58; {195990#true} is VALID [2022-04-08 08:54:59,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {195990#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {195990#true} is VALID [2022-04-08 08:54:59,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {195990#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {195990#true} is VALID [2022-04-08 08:54:59,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {195990#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {195990#true} is VALID [2022-04-08 08:54:59,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {195990#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,114 INFO L290 TraceCheckUtils]: 64: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,114 INFO L290 TraceCheckUtils]: 66: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,115 INFO L290 TraceCheckUtils]: 67: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,115 INFO L290 TraceCheckUtils]: 68: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:59,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {195995#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {195996#(= |ssl3_accept_#t~mem64| 8656)} is VALID [2022-04-08 08:54:59,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {195996#(= |ssl3_accept_#t~mem64| 8656)} assume 8544 == #t~mem64;havoc #t~mem64; {195991#false} is VALID [2022-04-08 08:54:59,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {195991#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 74: Hoare triple {195991#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {195991#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {195991#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {195991#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {195991#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 79: Hoare triple {195991#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 80: Hoare triple {195991#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 81: Hoare triple {195991#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 82: Hoare triple {195991#false} ~skip~0 := 0; {195991#false} is VALID [2022-04-08 08:54:59,117 INFO L290 TraceCheckUtils]: 83: Hoare triple {195991#false} assume !false; {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {195991#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 85: Hoare triple {195991#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 86: Hoare triple {195991#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 87: Hoare triple {195991#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {195991#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {195991#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {195991#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {195991#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 92: Hoare triple {195991#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,118 INFO L290 TraceCheckUtils]: 93: Hoare triple {195991#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 94: Hoare triple {195991#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {195991#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 96: Hoare triple {195991#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 97: Hoare triple {195991#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 98: Hoare triple {195991#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 99: Hoare triple {195991#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 100: Hoare triple {195991#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 101: Hoare triple {195991#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 102: Hoare triple {195991#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,119 INFO L290 TraceCheckUtils]: 103: Hoare triple {195991#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 104: Hoare triple {195991#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 105: Hoare triple {195991#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 106: Hoare triple {195991#false} assume 8448 == #t~mem68;havoc #t~mem68; {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 107: Hoare triple {195991#false} assume !(~num1~0 > 0); {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {195991#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 109: Hoare triple {195991#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 110: Hoare triple {195991#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 111: Hoare triple {195991#false} ~skip~0 := 0; {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 112: Hoare triple {195991#false} assume !false; {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 113: Hoare triple {195991#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,120 INFO L290 TraceCheckUtils]: 114: Hoare triple {195991#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 115: Hoare triple {195991#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 116: Hoare triple {195991#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 117: Hoare triple {195991#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 118: Hoare triple {195991#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 119: Hoare triple {195991#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 120: Hoare triple {195991#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 121: Hoare triple {195991#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 122: Hoare triple {195991#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 123: Hoare triple {195991#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 124: Hoare triple {195991#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,121 INFO L290 TraceCheckUtils]: 125: Hoare triple {195991#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 126: Hoare triple {195991#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 127: Hoare triple {195991#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 128: Hoare triple {195991#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 129: Hoare triple {195991#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 130: Hoare triple {195991#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 131: Hoare triple {195991#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 132: Hoare triple {195991#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 133: Hoare triple {195991#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 134: Hoare triple {195991#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,122 INFO L290 TraceCheckUtils]: 135: Hoare triple {195991#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 136: Hoare triple {195991#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 137: Hoare triple {195991#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 138: Hoare triple {195991#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 139: Hoare triple {195991#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 140: Hoare triple {195991#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 141: Hoare triple {195991#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 142: Hoare triple {195991#false} assume 8640 == #t~mem75;havoc #t~mem75; {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 143: Hoare triple {195991#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 144: Hoare triple {195991#false} assume !(4 == ~blastFlag~0); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 145: Hoare triple {195991#false} assume !(7 == ~blastFlag~0); {195991#false} is VALID [2022-04-08 08:54:59,123 INFO L290 TraceCheckUtils]: 146: Hoare triple {195991#false} assume !(10 == ~blastFlag~0); {195991#false} is VALID [2022-04-08 08:54:59,124 INFO L290 TraceCheckUtils]: 147: Hoare triple {195991#false} assume 13 == ~blastFlag~0; {195991#false} is VALID [2022-04-08 08:54:59,124 INFO L290 TraceCheckUtils]: 148: Hoare triple {195991#false} assume !false; {195991#false} is VALID [2022-04-08 08:54:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:54:59,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:54:59,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259637053] [2022-04-08 08:54:59,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259637053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:59,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:59,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:59,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:54:59,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412741043] [2022-04-08 08:54:59,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412741043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:59,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:59,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:59,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734247685] [2022-04-08 08:54:59,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:54:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-08 08:54:59,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:54:59,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:59,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:59,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:54:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:54:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:54:59,203 INFO L87 Difference]: Start difference. First operand 527 states and 784 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:02,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:05,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:07,165 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-08 08:55:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:12,713 INFO L93 Difference]: Finished difference Result 1054 states and 1575 transitions. [2022-04-08 08:55:12,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:55:12,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-08 08:55:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:55:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-08 08:55:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-08 08:55:12,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 529 transitions. [2022-04-08 08:55:13,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:13,081 INFO L225 Difference]: With dead ends: 1054 [2022-04-08 08:55:13,082 INFO L226 Difference]: Without dead ends: 555 [2022-04-08 08:55:13,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:55:13,083 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 61 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:55:13,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 525 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-04-08 08:55:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-08 08:55:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 527. [2022-04-08 08:55:13,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:55:13,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 555 states. Second operand has 527 states, 522 states have (on average 1.4923371647509578) internal successors, (779), 522 states have internal predecessors, (779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:13,129 INFO L74 IsIncluded]: Start isIncluded. First operand 555 states. Second operand has 527 states, 522 states have (on average 1.4923371647509578) internal successors, (779), 522 states have internal predecessors, (779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:13,130 INFO L87 Difference]: Start difference. First operand 555 states. Second operand has 527 states, 522 states have (on average 1.4923371647509578) internal successors, (779), 522 states have internal predecessors, (779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:13,144 INFO L93 Difference]: Finished difference Result 555 states and 822 transitions. [2022-04-08 08:55:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 822 transitions. [2022-04-08 08:55:13,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:13,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:13,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 527 states, 522 states have (on average 1.4923371647509578) internal successors, (779), 522 states have internal predecessors, (779), 3 states have call successors, (3), 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 555 states. [2022-04-08 08:55:13,145 INFO L87 Difference]: Start difference. First operand has 527 states, 522 states have (on average 1.4923371647509578) internal successors, (779), 522 states have internal predecessors, (779), 3 states have call successors, (3), 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 555 states. [2022-04-08 08:55:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:13,159 INFO L93 Difference]: Finished difference Result 555 states and 822 transitions. [2022-04-08 08:55:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 822 transitions. [2022-04-08 08:55:13,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:13,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:13,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:55:13,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:55:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 522 states have (on average 1.4923371647509578) internal successors, (779), 522 states have internal predecessors, (779), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 783 transitions. [2022-04-08 08:55:13,178 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 783 transitions. Word has length 149 [2022-04-08 08:55:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:55:13,178 INFO L478 AbstractCegarLoop]: Abstraction has 527 states and 783 transitions. [2022-04-08 08:55:13,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:13,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 527 states and 783 transitions. [2022-04-08 08:55:13,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 783 edges. 783 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 783 transitions. [2022-04-08 08:55:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-08 08:55:13,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:55:13,963 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:55:13,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-08 08:55:13,963 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:55:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:55:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash -292719464, now seen corresponding path program 1 times [2022-04-08 08:55:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:13,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [916769627] [2022-04-08 08:55:14,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:55:14,058 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:55:14,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:55:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash -292719464, now seen corresponding path program 2 times [2022-04-08 08:55:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:55:14,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554514735] [2022-04-08 08:55:14,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:55:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:55:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:55:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:14,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {200274#true} is VALID [2022-04-08 08:55:14,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {200274#true} assume true; {200274#true} is VALID [2022-04-08 08:55:14,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {200274#true} {200274#true} #708#return; {200274#true} is VALID [2022-04-08 08:55:14,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {200274#true} call ULTIMATE.init(); {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:55:14,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {200274#true} assume true; {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {200274#true} {200274#true} #708#return; {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {200274#true} call #t~ret161 := main(); {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {200274#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {200274#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L272 TraceCheckUtils]: 7: Hoare triple {200274#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {200274#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {200274#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {200274#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {200274#true} is VALID [2022-04-08 08:55:14,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {200274#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {200274#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {200274#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {200274#true} assume !false; {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {200274#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {200274#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {200274#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {200274#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {200274#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {200274#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {200274#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {200274#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {200274#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {200274#true} assume 8464 == #t~mem55;havoc #t~mem55; {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {200274#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {200274#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {200274#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {200274#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {200274#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {200274#true} ~skip~0 := 0; {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {200274#true} assume !false; {200274#true} is VALID [2022-04-08 08:55:14,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {200274#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {200274#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {200274#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {200274#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {200274#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {200274#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {200274#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {200274#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {200274#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {200274#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {200274#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {200274#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {200274#true} assume 8496 == #t~mem58;havoc #t~mem58; {200274#true} is VALID [2022-04-08 08:55:14,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {200274#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {200274#true} is VALID [2022-04-08 08:55:14,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {200274#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {200274#true} is VALID [2022-04-08 08:55:14,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {200274#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {200274#true} is VALID [2022-04-08 08:55:14,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {200274#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,324 INFO L290 TraceCheckUtils]: 60: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,324 INFO L290 TraceCheckUtils]: 61: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,324 INFO L290 TraceCheckUtils]: 62: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,325 INFO L290 TraceCheckUtils]: 63: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,325 INFO L290 TraceCheckUtils]: 64: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,326 INFO L290 TraceCheckUtils]: 66: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,327 INFO L290 TraceCheckUtils]: 67: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,328 INFO L290 TraceCheckUtils]: 69: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,328 INFO L290 TraceCheckUtils]: 70: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,328 INFO L290 TraceCheckUtils]: 71: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:14,329 INFO L290 TraceCheckUtils]: 72: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {200280#(= |ssl3_accept_#t~mem65| 8656)} is VALID [2022-04-08 08:55:14,329 INFO L290 TraceCheckUtils]: 73: Hoare triple {200280#(= |ssl3_accept_#t~mem65| 8656)} assume 8545 == #t~mem65;havoc #t~mem65; {200275#false} is VALID [2022-04-08 08:55:14,329 INFO L290 TraceCheckUtils]: 74: Hoare triple {200275#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 75: Hoare triple {200275#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 76: Hoare triple {200275#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 77: Hoare triple {200275#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 78: Hoare triple {200275#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 79: Hoare triple {200275#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 80: Hoare triple {200275#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 81: Hoare triple {200275#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 82: Hoare triple {200275#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 83: Hoare triple {200275#false} ~skip~0 := 0; {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 84: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-08 08:55:14,330 INFO L290 TraceCheckUtils]: 85: Hoare triple {200275#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 86: Hoare triple {200275#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 87: Hoare triple {200275#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 88: Hoare triple {200275#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 89: Hoare triple {200275#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 90: Hoare triple {200275#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {200275#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {200275#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {200275#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 94: Hoare triple {200275#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 95: Hoare triple {200275#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 96: Hoare triple {200275#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 97: Hoare triple {200275#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 98: Hoare triple {200275#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,331 INFO L290 TraceCheckUtils]: 99: Hoare triple {200275#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 100: Hoare triple {200275#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 101: Hoare triple {200275#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 102: Hoare triple {200275#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 103: Hoare triple {200275#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 104: Hoare triple {200275#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 105: Hoare triple {200275#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 106: Hoare triple {200275#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 107: Hoare triple {200275#false} assume 8448 == #t~mem68;havoc #t~mem68; {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 108: Hoare triple {200275#false} assume !(~num1~0 > 0); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 109: Hoare triple {200275#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 110: Hoare triple {200275#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 111: Hoare triple {200275#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 112: Hoare triple {200275#false} ~skip~0 := 0; {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 113: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-08 08:55:14,332 INFO L290 TraceCheckUtils]: 114: Hoare triple {200275#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 115: Hoare triple {200275#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 116: Hoare triple {200275#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 117: Hoare triple {200275#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 118: Hoare triple {200275#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 119: Hoare triple {200275#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 120: Hoare triple {200275#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 121: Hoare triple {200275#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 122: Hoare triple {200275#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 123: Hoare triple {200275#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 124: Hoare triple {200275#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 125: Hoare triple {200275#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 126: Hoare triple {200275#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 127: Hoare triple {200275#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 128: Hoare triple {200275#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,333 INFO L290 TraceCheckUtils]: 129: Hoare triple {200275#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 130: Hoare triple {200275#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 131: Hoare triple {200275#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 132: Hoare triple {200275#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 133: Hoare triple {200275#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 134: Hoare triple {200275#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 135: Hoare triple {200275#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 136: Hoare triple {200275#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 137: Hoare triple {200275#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 138: Hoare triple {200275#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 139: Hoare triple {200275#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 140: Hoare triple {200275#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 141: Hoare triple {200275#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 142: Hoare triple {200275#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-08 08:55:14,334 INFO L290 TraceCheckUtils]: 143: Hoare triple {200275#false} assume 8640 == #t~mem75;havoc #t~mem75; {200275#false} is VALID [2022-04-08 08:55:14,335 INFO L290 TraceCheckUtils]: 144: Hoare triple {200275#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {200275#false} is VALID [2022-04-08 08:55:14,335 INFO L290 TraceCheckUtils]: 145: Hoare triple {200275#false} assume !(4 == ~blastFlag~0); {200275#false} is VALID [2022-04-08 08:55:14,335 INFO L290 TraceCheckUtils]: 146: Hoare triple {200275#false} assume !(7 == ~blastFlag~0); {200275#false} is VALID [2022-04-08 08:55:14,335 INFO L290 TraceCheckUtils]: 147: Hoare triple {200275#false} assume !(10 == ~blastFlag~0); {200275#false} is VALID [2022-04-08 08:55:14,335 INFO L290 TraceCheckUtils]: 148: Hoare triple {200275#false} assume 13 == ~blastFlag~0; {200275#false} is VALID [2022-04-08 08:55:14,335 INFO L290 TraceCheckUtils]: 149: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-08 08:55:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:55:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:55:14,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554514735] [2022-04-08 08:55:14,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554514735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:14,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:14,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:14,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:55:14,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [916769627] [2022-04-08 08:55:14,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [916769627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:14,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:14,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028079054] [2022-04-08 08:55:14,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:55:14,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2022-04-08 08:55:14,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:55:14,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:14,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:14,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:55:14,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:14,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:55:14,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:55:14,413 INFO L87 Difference]: Start difference. First operand 527 states and 783 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:20,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:22,964 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-08 08:55:26,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:31,597 INFO L93 Difference]: Finished difference Result 1046 states and 1560 transitions. [2022-04-08 08:55:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:55:31,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2022-04-08 08:55:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:55:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2022-04-08 08:55:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2022-04-08 08:55:31,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 515 transitions. [2022-04-08 08:55:31,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:31,945 INFO L225 Difference]: With dead ends: 1046 [2022-04-08 08:55:31,945 INFO L226 Difference]: Without dead ends: 547 [2022-04-08 08:55:31,946 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:55:31,946 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 50 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:55:31,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 543 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-04-08 08:55:31,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-08 08:55:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 527. [2022-04-08 08:55:31,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:55:31,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 527 states, 522 states have (on average 1.4904214559386972) internal successors, (778), 522 states have internal predecessors, (778), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,978 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 527 states, 522 states have (on average 1.4904214559386972) internal successors, (778), 522 states have internal predecessors, (778), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,978 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 527 states, 522 states have (on average 1.4904214559386972) internal successors, (778), 522 states have internal predecessors, (778), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:31,992 INFO L93 Difference]: Finished difference Result 547 states and 808 transitions. [2022-04-08 08:55:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 808 transitions. [2022-04-08 08:55:31,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:31,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:31,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 527 states, 522 states have (on average 1.4904214559386972) internal successors, (778), 522 states have internal predecessors, (778), 3 states have call successors, (3), 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 547 states. [2022-04-08 08:55:31,993 INFO L87 Difference]: Start difference. First operand has 527 states, 522 states have (on average 1.4904214559386972) internal successors, (778), 522 states have internal predecessors, (778), 3 states have call successors, (3), 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 547 states. [2022-04-08 08:55:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:32,007 INFO L93 Difference]: Finished difference Result 547 states and 808 transitions. [2022-04-08 08:55:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 808 transitions. [2022-04-08 08:55:32,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:32,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:32,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:55:32,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:55:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 522 states have (on average 1.4904214559386972) internal successors, (778), 522 states have internal predecessors, (778), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 782 transitions. [2022-04-08 08:55:32,024 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 782 transitions. Word has length 150 [2022-04-08 08:55:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:55:32,025 INFO L478 AbstractCegarLoop]: Abstraction has 527 states and 782 transitions. [2022-04-08 08:55:32,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:32,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 527 states and 782 transitions. [2022-04-08 08:55:32,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 782 edges. 782 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 782 transitions. [2022-04-08 08:55:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 08:55:32,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:55:32,798 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:55:32,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-08 08:55:32,798 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:55:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:55:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 808921102, now seen corresponding path program 1 times [2022-04-08 08:55:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:32,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260029353] [2022-04-08 08:55:32,887 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:55:32,887 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:55:32,887 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:55:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash 808921102, now seen corresponding path program 2 times [2022-04-08 08:55:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:55:32,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764007356] [2022-04-08 08:55:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:55:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:55:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:33,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:55:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:33,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {204533#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {204526#true} is VALID [2022-04-08 08:55:33,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {204526#true} assume true; {204526#true} is VALID [2022-04-08 08:55:33,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204526#true} {204526#true} #708#return; {204526#true} is VALID [2022-04-08 08:55:33,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {204526#true} call ULTIMATE.init(); {204533#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:55:33,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {204533#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {204526#true} is VALID [2022-04-08 08:55:33,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {204526#true} assume true; {204526#true} is VALID [2022-04-08 08:55:33,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204526#true} {204526#true} #708#return; {204526#true} is VALID [2022-04-08 08:55:33,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {204526#true} call #t~ret161 := main(); {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {204526#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {204526#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L272 TraceCheckUtils]: 7: Hoare triple {204526#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {204526#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {204526#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {204526#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {204526#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {204526#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {204526#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {204526#true} assume !false; {204526#true} is VALID [2022-04-08 08:55:33,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {204526#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {204526#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {204526#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {204526#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {204526#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {204526#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {204526#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {204526#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {204526#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {204526#true} assume 8464 == #t~mem55;havoc #t~mem55; {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {204526#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {204526#true} is VALID [2022-04-08 08:55:33,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {204526#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {204526#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {204526#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {204526#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {204526#true} ~skip~0 := 0; {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {204526#true} assume !false; {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {204526#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {204526#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {204526#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {204526#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {204526#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {204526#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {204526#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {204526#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {204526#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {204526#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {204526#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {204526#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {204526#true} assume 8496 == #t~mem58;havoc #t~mem58; {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {204526#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {204526#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {204526#true} is VALID [2022-04-08 08:55:33,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {204526#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {204526#true} is VALID [2022-04-08 08:55:33,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {204526#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} ~skip~0 := 0; {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !false; {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,168 INFO L290 TraceCheckUtils]: 63: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:55:33,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {204531#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {204532#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-08 08:55:33,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {204532#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {204527#false} is VALID [2022-04-08 08:55:33,171 INFO L290 TraceCheckUtils]: 69: Hoare triple {204527#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {204527#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {204527#false} is VALID [2022-04-08 08:55:33,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {204527#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {204527#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,172 INFO L290 TraceCheckUtils]: 73: Hoare triple {204527#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {204527#false} is VALID [2022-04-08 08:55:33,172 INFO L290 TraceCheckUtils]: 74: Hoare triple {204527#false} ~skip~0 := 0; {204527#false} is VALID [2022-04-08 08:55:33,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {204527#false} assume !false; {204527#false} is VALID [2022-04-08 08:55:33,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {204527#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 77: Hoare triple {204527#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {204527#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {204527#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {204527#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {204527#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 82: Hoare triple {204527#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 83: Hoare triple {204527#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {204527#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 85: Hoare triple {204527#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,173 INFO L290 TraceCheckUtils]: 86: Hoare triple {204527#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 87: Hoare triple {204527#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 88: Hoare triple {204527#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 89: Hoare triple {204527#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 90: Hoare triple {204527#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 91: Hoare triple {204527#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {204527#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 93: Hoare triple {204527#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 94: Hoare triple {204527#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 95: Hoare triple {204527#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 96: Hoare triple {204527#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,174 INFO L290 TraceCheckUtils]: 97: Hoare triple {204527#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 98: Hoare triple {204527#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 99: Hoare triple {204527#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 100: Hoare triple {204527#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 101: Hoare triple {204527#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 102: Hoare triple {204527#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 103: Hoare triple {204527#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 104: Hoare triple {204527#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 105: Hoare triple {204527#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 106: Hoare triple {204527#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 107: Hoare triple {204527#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,175 INFO L290 TraceCheckUtils]: 108: Hoare triple {204527#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 109: Hoare triple {204527#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 110: Hoare triple {204527#false} assume 8673 == #t~mem80;havoc #t~mem80; {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 111: Hoare triple {204527#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 112: Hoare triple {204527#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 113: Hoare triple {204527#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 114: Hoare triple {204527#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 115: Hoare triple {204527#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 116: Hoare triple {204527#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 117: Hoare triple {204527#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 118: Hoare triple {204527#false} ~skip~0 := 0; {204527#false} is VALID [2022-04-08 08:55:33,176 INFO L290 TraceCheckUtils]: 119: Hoare triple {204527#false} assume !false; {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 120: Hoare triple {204527#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 121: Hoare triple {204527#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 122: Hoare triple {204527#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 123: Hoare triple {204527#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 124: Hoare triple {204527#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 125: Hoare triple {204527#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 126: Hoare triple {204527#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 127: Hoare triple {204527#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 128: Hoare triple {204527#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 129: Hoare triple {204527#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,177 INFO L290 TraceCheckUtils]: 130: Hoare triple {204527#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 131: Hoare triple {204527#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 132: Hoare triple {204527#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 133: Hoare triple {204527#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 134: Hoare triple {204527#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 135: Hoare triple {204527#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 136: Hoare triple {204527#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 137: Hoare triple {204527#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 138: Hoare triple {204527#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 139: Hoare triple {204527#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,178 INFO L290 TraceCheckUtils]: 140: Hoare triple {204527#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 141: Hoare triple {204527#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 142: Hoare triple {204527#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 143: Hoare triple {204527#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 144: Hoare triple {204527#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 145: Hoare triple {204527#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 146: Hoare triple {204527#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 147: Hoare triple {204527#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 148: Hoare triple {204527#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 149: Hoare triple {204527#false} assume 8640 == #t~mem75;havoc #t~mem75; {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 150: Hoare triple {204527#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {204527#false} is VALID [2022-04-08 08:55:33,179 INFO L290 TraceCheckUtils]: 151: Hoare triple {204527#false} assume !(4 == ~blastFlag~0); {204527#false} is VALID [2022-04-08 08:55:33,180 INFO L290 TraceCheckUtils]: 152: Hoare triple {204527#false} assume !(7 == ~blastFlag~0); {204527#false} is VALID [2022-04-08 08:55:33,180 INFO L290 TraceCheckUtils]: 153: Hoare triple {204527#false} assume !(10 == ~blastFlag~0); {204527#false} is VALID [2022-04-08 08:55:33,180 INFO L290 TraceCheckUtils]: 154: Hoare triple {204527#false} assume 13 == ~blastFlag~0; {204527#false} is VALID [2022-04-08 08:55:33,180 INFO L290 TraceCheckUtils]: 155: Hoare triple {204527#false} assume !false; {204527#false} is VALID [2022-04-08 08:55:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 08:55:33,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:55:33,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764007356] [2022-04-08 08:55:33,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764007356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:33,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:33,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:33,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:55:33,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260029353] [2022-04-08 08:55:33,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260029353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:33,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:33,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186751067] [2022-04-08 08:55:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:55:33,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 08:55:33,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:55:33,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:33,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:33,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:55:33,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:33,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:55:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:55:33,277 INFO L87 Difference]: Start difference. First operand 527 states and 782 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:37,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:40,329 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-08 08:55:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:47,456 INFO L93 Difference]: Finished difference Result 1094 states and 1630 transitions. [2022-04-08 08:55:47,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:55:47,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 08:55:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:55:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:55:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:55:47,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-08 08:55:47,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:47,879 INFO L225 Difference]: With dead ends: 1094 [2022-04-08 08:55:47,879 INFO L226 Difference]: Without dead ends: 595 [2022-04-08 08:55:47,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:55:47,880 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:55:47,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 400 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-04-08 08:55:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-08 08:55:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 527. [2022-04-08 08:55:47,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:55:47,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 527 states, 522 states have (on average 1.475095785440613) internal successors, (770), 522 states have internal predecessors, (770), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:47,913 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 527 states, 522 states have (on average 1.475095785440613) internal successors, (770), 522 states have internal predecessors, (770), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:47,913 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 527 states, 522 states have (on average 1.475095785440613) internal successors, (770), 522 states have internal predecessors, (770), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:47,924 INFO L93 Difference]: Finished difference Result 595 states and 872 transitions. [2022-04-08 08:55:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 872 transitions. [2022-04-08 08:55:47,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:47,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:47,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 527 states, 522 states have (on average 1.475095785440613) internal successors, (770), 522 states have internal predecessors, (770), 3 states have call successors, (3), 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 595 states. [2022-04-08 08:55:47,925 INFO L87 Difference]: Start difference. First operand has 527 states, 522 states have (on average 1.475095785440613) internal successors, (770), 522 states have internal predecessors, (770), 3 states have call successors, (3), 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 595 states. [2022-04-08 08:55:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:47,935 INFO L93 Difference]: Finished difference Result 595 states and 872 transitions. [2022-04-08 08:55:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 872 transitions. [2022-04-08 08:55:47,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:47,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:47,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:55:47,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:55:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 522 states have (on average 1.475095785440613) internal successors, (770), 522 states have internal predecessors, (770), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 774 transitions. [2022-04-08 08:55:47,947 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 774 transitions. Word has length 156 [2022-04-08 08:55:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:55:47,947 INFO L478 AbstractCegarLoop]: Abstraction has 527 states and 774 transitions. [2022-04-08 08:55:47,948 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:47,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 527 states and 774 transitions. [2022-04-08 08:55:48,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 774 edges. 774 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 774 transitions. [2022-04-08 08:55:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 08:55:48,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:55:48,725 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-08 08:55:48,725 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-08 08:55:48,725 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:55:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:55:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash -978144245, now seen corresponding path program 1 times [2022-04-08 08:55:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:48,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1839746935] [2022-04-08 08:55:48,810 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:55:48,810 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:55:48,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:55:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash -978144245, now seen corresponding path program 2 times [2022-04-08 08:55:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:55:48,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078119872] [2022-04-08 08:55:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:55:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:55:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:55:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:49,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {208977#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {208970#true} is VALID [2022-04-08 08:55:49,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {208970#true} assume true; {208970#true} is VALID [2022-04-08 08:55:49,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208970#true} {208970#true} #708#return; {208970#true} is VALID [2022-04-08 08:55:49,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {208970#true} call ULTIMATE.init(); {208977#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:55:49,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {208977#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {208970#true} is VALID [2022-04-08 08:55:49,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {208970#true} assume true; {208970#true} is VALID [2022-04-08 08:55:49,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208970#true} {208970#true} #708#return; {208970#true} is VALID [2022-04-08 08:55:49,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {208970#true} call #t~ret161 := main(); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {208970#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {208970#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L272 TraceCheckUtils]: 7: Hoare triple {208970#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {208970#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {208970#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {208970#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {208970#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {208970#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {208970#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {208970#true} assume !false; {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {208970#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {208970#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {208970#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {208970#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {208970#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {208970#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {208970#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {208970#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {208970#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {208970#true} assume 8464 == #t~mem55;havoc #t~mem55; {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {208970#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {208970#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {208970#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {208970#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {208970#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {208970#true} ~skip~0 := 0; {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {208970#true} assume !false; {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {208970#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {208970#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {208970#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {208970#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {208970#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {208970#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {208970#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {208970#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {208970#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {208970#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {208970#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {208970#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {208970#true} assume 8496 == #t~mem58;havoc #t~mem58; {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {208970#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {208970#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {208970#true} is VALID [2022-04-08 08:55:49,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {208970#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {208970#true} is VALID [2022-04-08 08:55:49,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {208970#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,065 INFO L290 TraceCheckUtils]: 68: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,066 INFO L290 TraceCheckUtils]: 71: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,066 INFO L290 TraceCheckUtils]: 73: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,067 INFO L290 TraceCheckUtils]: 74: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,067 INFO L290 TraceCheckUtils]: 75: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,067 INFO L290 TraceCheckUtils]: 76: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,068 INFO L290 TraceCheckUtils]: 77: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:55:49,068 INFO L290 TraceCheckUtils]: 78: Hoare triple {208975#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {208976#(= |ssl3_accept_#t~mem71| 8656)} is VALID [2022-04-08 08:55:49,068 INFO L290 TraceCheckUtils]: 79: Hoare triple {208976#(= |ssl3_accept_#t~mem71| 8656)} assume 8592 == #t~mem71;havoc #t~mem71; {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 80: Hoare triple {208971#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 81: Hoare triple {208971#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 82: Hoare triple {208971#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 83: Hoare triple {208971#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 84: Hoare triple {208971#false} ~skip~0 := 0; {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 85: Hoare triple {208971#false} assume !false; {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 86: Hoare triple {208971#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 87: Hoare triple {208971#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 88: Hoare triple {208971#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 89: Hoare triple {208971#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 90: Hoare triple {208971#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 91: Hoare triple {208971#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 92: Hoare triple {208971#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 93: Hoare triple {208971#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,069 INFO L290 TraceCheckUtils]: 94: Hoare triple {208971#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 95: Hoare triple {208971#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 96: Hoare triple {208971#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 97: Hoare triple {208971#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 98: Hoare triple {208971#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 99: Hoare triple {208971#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 100: Hoare triple {208971#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 101: Hoare triple {208971#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 102: Hoare triple {208971#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 103: Hoare triple {208971#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 104: Hoare triple {208971#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 105: Hoare triple {208971#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 106: Hoare triple {208971#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 107: Hoare triple {208971#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 108: Hoare triple {208971#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,070 INFO L290 TraceCheckUtils]: 109: Hoare triple {208971#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 110: Hoare triple {208971#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 111: Hoare triple {208971#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 112: Hoare triple {208971#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 113: Hoare triple {208971#false} assume 8608 == #t~mem73;havoc #t~mem73; {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 114: Hoare triple {208971#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 115: Hoare triple {208971#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 116: Hoare triple {208971#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 117: Hoare triple {208971#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 118: Hoare triple {208971#false} ~skip~0 := 0; {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 119: Hoare triple {208971#false} assume !false; {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 120: Hoare triple {208971#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 121: Hoare triple {208971#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 122: Hoare triple {208971#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 123: Hoare triple {208971#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,071 INFO L290 TraceCheckUtils]: 124: Hoare triple {208971#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 125: Hoare triple {208971#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 126: Hoare triple {208971#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 127: Hoare triple {208971#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 128: Hoare triple {208971#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 129: Hoare triple {208971#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 130: Hoare triple {208971#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 131: Hoare triple {208971#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 132: Hoare triple {208971#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 133: Hoare triple {208971#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 134: Hoare triple {208971#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 135: Hoare triple {208971#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 136: Hoare triple {208971#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 137: Hoare triple {208971#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 138: Hoare triple {208971#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,072 INFO L290 TraceCheckUtils]: 139: Hoare triple {208971#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 140: Hoare triple {208971#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 141: Hoare triple {208971#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 142: Hoare triple {208971#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 143: Hoare triple {208971#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 144: Hoare triple {208971#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 145: Hoare triple {208971#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 146: Hoare triple {208971#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 147: Hoare triple {208971#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 148: Hoare triple {208971#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 149: Hoare triple {208971#false} assume 8640 == #t~mem75;havoc #t~mem75; {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 150: Hoare triple {208971#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 151: Hoare triple {208971#false} assume !(4 == ~blastFlag~0); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 152: Hoare triple {208971#false} assume !(7 == ~blastFlag~0); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 153: Hoare triple {208971#false} assume !(10 == ~blastFlag~0); {208971#false} is VALID [2022-04-08 08:55:49,073 INFO L290 TraceCheckUtils]: 154: Hoare triple {208971#false} assume 13 == ~blastFlag~0; {208971#false} is VALID [2022-04-08 08:55:49,074 INFO L290 TraceCheckUtils]: 155: Hoare triple {208971#false} assume !false; {208971#false} is VALID [2022-04-08 08:55:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-08 08:55:49,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:55:49,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078119872] [2022-04-08 08:55:49,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078119872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:49,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:49,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:49,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:55:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1839746935] [2022-04-08 08:55:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1839746935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:49,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:49,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658839663] [2022-04-08 08:55:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:55:49,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 08:55:49,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:55:49,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:49,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:49,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:55:49,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:49,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:55:49,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:55:49,153 INFO L87 Difference]: Start difference. First operand 527 states and 774 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:02,688 INFO L93 Difference]: Finished difference Result 1046 states and 1542 transitions. [2022-04-08 08:56:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:56:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 08:56:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:56:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2022-04-08 08:56:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2022-04-08 08:56:02,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 513 transitions. [2022-04-08 08:56:03,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 513 edges. 513 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:03,041 INFO L225 Difference]: With dead ends: 1046 [2022-04-08 08:56:03,041 INFO L226 Difference]: Without dead ends: 547 [2022-04-08 08:56:03,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:56:03,042 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 42 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:56:03,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 553 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 08:56:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-08 08:56:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 527. [2022-04-08 08:56:03,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:56:03,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 527 states, 522 states have (on average 1.4731800766283525) internal successors, (769), 522 states have internal predecessors, (769), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:03,075 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 527 states, 522 states have (on average 1.4731800766283525) internal successors, (769), 522 states have internal predecessors, (769), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:03,075 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 527 states, 522 states have (on average 1.4731800766283525) internal successors, (769), 522 states have internal predecessors, (769), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:03,085 INFO L93 Difference]: Finished difference Result 547 states and 799 transitions. [2022-04-08 08:56:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 799 transitions. [2022-04-08 08:56:03,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:03,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:03,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 527 states, 522 states have (on average 1.4731800766283525) internal successors, (769), 522 states have internal predecessors, (769), 3 states have call successors, (3), 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 547 states. [2022-04-08 08:56:03,086 INFO L87 Difference]: Start difference. First operand has 527 states, 522 states have (on average 1.4731800766283525) internal successors, (769), 522 states have internal predecessors, (769), 3 states have call successors, (3), 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 547 states. [2022-04-08 08:56:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:03,095 INFO L93 Difference]: Finished difference Result 547 states and 799 transitions. [2022-04-08 08:56:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 799 transitions. [2022-04-08 08:56:03,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:03,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:03,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:56:03,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:56:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 522 states have (on average 1.4731800766283525) internal successors, (769), 522 states have internal predecessors, (769), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2022-04-08 08:56:03,106 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 156 [2022-04-08 08:56:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:56:03,106 INFO L478 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2022-04-08 08:56:03,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:03,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 527 states and 773 transitions. [2022-04-08 08:56:03,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 773 edges. 773 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2022-04-08 08:56:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 08:56:03,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:56:03,888 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:56:03,888 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-08 08:56:03,888 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:56:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:56:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1164244276, now seen corresponding path program 1 times [2022-04-08 08:56:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:03,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075498416] [2022-04-08 08:56:03,984 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:56:03,984 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:56:03,984 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:56:03,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1164244276, now seen corresponding path program 2 times [2022-04-08 08:56:03,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:56:03,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095349323] [2022-04-08 08:56:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:56:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:56:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:56:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:56:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:56:04,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {213228#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {213222#true} is VALID [2022-04-08 08:56:04,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {213222#true} assume true; {213222#true} is VALID [2022-04-08 08:56:04,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213222#true} {213222#true} #708#return; {213222#true} is VALID [2022-04-08 08:56:04,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {213222#true} call ULTIMATE.init(); {213228#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:56:04,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {213228#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {213222#true} assume true; {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213222#true} {213222#true} #708#return; {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {213222#true} call #t~ret161 := main(); {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {213222#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {213222#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L272 TraceCheckUtils]: 7: Hoare triple {213222#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {213222#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {213222#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {213222#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {213222#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {213222#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {213222#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {213222#true} assume !false; {213222#true} is VALID [2022-04-08 08:56:04,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {213222#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {213222#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {213222#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {213222#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {213222#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {213222#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {213222#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {213222#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {213222#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {213222#true} assume 8464 == #t~mem55;havoc #t~mem55; {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {213222#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {213222#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {213222#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {213222#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {213222#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213222#true} is VALID [2022-04-08 08:56:04,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {213222#true} ~skip~0 := 0; {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {213222#true} assume !false; {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {213222#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {213222#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {213222#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {213222#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {213222#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {213222#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {213222#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {213222#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {213222#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {213222#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {213222#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {213222#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {213222#true} assume 8496 == #t~mem58;havoc #t~mem58; {213222#true} is VALID [2022-04-08 08:56:04,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {213222#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {213222#true} is VALID [2022-04-08 08:56:04,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {213222#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,184 INFO L290 TraceCheckUtils]: 63: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,184 INFO L290 TraceCheckUtils]: 64: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,185 INFO L290 TraceCheckUtils]: 66: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,185 INFO L290 TraceCheckUtils]: 67: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,185 INFO L290 TraceCheckUtils]: 68: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,186 INFO L290 TraceCheckUtils]: 69: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,186 INFO L290 TraceCheckUtils]: 70: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,186 INFO L290 TraceCheckUtils]: 72: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,188 INFO L290 TraceCheckUtils]: 76: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,188 INFO L290 TraceCheckUtils]: 77: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,188 INFO L290 TraceCheckUtils]: 78: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,188 INFO L290 TraceCheckUtils]: 79: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,189 INFO L290 TraceCheckUtils]: 80: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,189 INFO L290 TraceCheckUtils]: 81: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,189 INFO L290 TraceCheckUtils]: 82: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,189 INFO L290 TraceCheckUtils]: 83: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,190 INFO L290 TraceCheckUtils]: 84: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,190 INFO L290 TraceCheckUtils]: 85: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,190 INFO L290 TraceCheckUtils]: 86: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,190 INFO L290 TraceCheckUtils]: 87: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,191 INFO L290 TraceCheckUtils]: 88: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,191 INFO L290 TraceCheckUtils]: 89: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,191 INFO L290 TraceCheckUtils]: 90: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,192 INFO L290 TraceCheckUtils]: 91: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,192 INFO L290 TraceCheckUtils]: 92: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,192 INFO L290 TraceCheckUtils]: 93: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,192 INFO L290 TraceCheckUtils]: 94: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,193 INFO L290 TraceCheckUtils]: 95: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,193 INFO L290 TraceCheckUtils]: 96: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,193 INFO L290 TraceCheckUtils]: 97: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,193 INFO L290 TraceCheckUtils]: 98: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,194 INFO L290 TraceCheckUtils]: 99: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,194 INFO L290 TraceCheckUtils]: 100: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,194 INFO L290 TraceCheckUtils]: 101: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,194 INFO L290 TraceCheckUtils]: 102: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,195 INFO L290 TraceCheckUtils]: 103: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,195 INFO L290 TraceCheckUtils]: 104: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,195 INFO L290 TraceCheckUtils]: 105: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,196 INFO L290 TraceCheckUtils]: 106: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,196 INFO L290 TraceCheckUtils]: 107: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,196 INFO L290 TraceCheckUtils]: 108: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,199 INFO L290 TraceCheckUtils]: 109: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,199 INFO L290 TraceCheckUtils]: 110: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume 8673 == #t~mem80;havoc #t~mem80; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,201 INFO L290 TraceCheckUtils]: 111: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {213227#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:04,203 INFO L290 TraceCheckUtils]: 112: Hoare triple {213227#(= 2 ssl3_accept_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {213223#false} is VALID [2022-04-08 08:56:04,203 INFO L290 TraceCheckUtils]: 113: Hoare triple {213223#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,203 INFO L290 TraceCheckUtils]: 114: Hoare triple {213223#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 115: Hoare triple {213223#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 116: Hoare triple {213223#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 117: Hoare triple {213223#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 118: Hoare triple {213223#false} ~skip~0 := 0; {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 119: Hoare triple {213223#false} assume !false; {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 120: Hoare triple {213223#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 121: Hoare triple {213223#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 122: Hoare triple {213223#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 123: Hoare triple {213223#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 124: Hoare triple {213223#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,204 INFO L290 TraceCheckUtils]: 125: Hoare triple {213223#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 126: Hoare triple {213223#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 127: Hoare triple {213223#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 128: Hoare triple {213223#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 129: Hoare triple {213223#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 130: Hoare triple {213223#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 131: Hoare triple {213223#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 132: Hoare triple {213223#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 133: Hoare triple {213223#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 134: Hoare triple {213223#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,205 INFO L290 TraceCheckUtils]: 135: Hoare triple {213223#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 136: Hoare triple {213223#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 137: Hoare triple {213223#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 138: Hoare triple {213223#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 139: Hoare triple {213223#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 140: Hoare triple {213223#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 141: Hoare triple {213223#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 142: Hoare triple {213223#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 143: Hoare triple {213223#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 144: Hoare triple {213223#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,206 INFO L290 TraceCheckUtils]: 145: Hoare triple {213223#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 146: Hoare triple {213223#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 147: Hoare triple {213223#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 148: Hoare triple {213223#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 149: Hoare triple {213223#false} assume 8640 == #t~mem75;havoc #t~mem75; {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 150: Hoare triple {213223#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 151: Hoare triple {213223#false} assume !(4 == ~blastFlag~0); {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 152: Hoare triple {213223#false} assume !(7 == ~blastFlag~0); {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 153: Hoare triple {213223#false} assume !(10 == ~blastFlag~0); {213223#false} is VALID [2022-04-08 08:56:04,207 INFO L290 TraceCheckUtils]: 154: Hoare triple {213223#false} assume 13 == ~blastFlag~0; {213223#false} is VALID [2022-04-08 08:56:04,208 INFO L290 TraceCheckUtils]: 155: Hoare triple {213223#false} assume !false; {213223#false} is VALID [2022-04-08 08:56:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 08:56:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:56:04,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095349323] [2022-04-08 08:56:04,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095349323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:56:04,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:56:04,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:56:04,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:56:04,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1075498416] [2022-04-08 08:56:04,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1075498416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:56:04,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:56:04,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:56:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716472017] [2022-04-08 08:56:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:56:04,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 08:56:04,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:56:04,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:04,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:04,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:56:04,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:04,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:56:04,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:56:04,297 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:08,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:56:10,917 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-08 08:56:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:14,971 INFO L93 Difference]: Finished difference Result 1478 states and 2187 transitions. [2022-04-08 08:56:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:56:14,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-08 08:56:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:56:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2022-04-08 08:56:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2022-04-08 08:56:14,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 622 transitions. [2022-04-08 08:56:15,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:15,413 INFO L225 Difference]: With dead ends: 1478 [2022-04-08 08:56:15,413 INFO L226 Difference]: Without dead ends: 979 [2022-04-08 08:56:15,413 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:56:15,414 INFO L913 BasicCegarLoop]: 259 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:56:15,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 453 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 311 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 08:56:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2022-04-08 08:56:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2022-04-08 08:56:15,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:56:15,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 979 states. Second operand has 979 states, 974 states have (on average 1.4691991786447638) internal successors, (1431), 974 states have internal predecessors, (1431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:15,475 INFO L74 IsIncluded]: Start isIncluded. First operand 979 states. Second operand has 979 states, 974 states have (on average 1.4691991786447638) internal successors, (1431), 974 states have internal predecessors, (1431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:15,476 INFO L87 Difference]: Start difference. First operand 979 states. Second operand has 979 states, 974 states have (on average 1.4691991786447638) internal successors, (1431), 974 states have internal predecessors, (1431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:15,501 INFO L93 Difference]: Finished difference Result 979 states and 1435 transitions. [2022-04-08 08:56:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1435 transitions. [2022-04-08 08:56:15,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:15,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:15,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4691991786447638) internal successors, (1431), 974 states have internal predecessors, (1431), 3 states have call successors, (3), 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 979 states. [2022-04-08 08:56:15,503 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4691991786447638) internal successors, (1431), 974 states have internal predecessors, (1431), 3 states have call successors, (3), 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 979 states. [2022-04-08 08:56:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:15,530 INFO L93 Difference]: Finished difference Result 979 states and 1435 transitions. [2022-04-08 08:56:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1435 transitions. [2022-04-08 08:56:15,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:15,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:15,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:56:15,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:56:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4691991786447638) internal successors, (1431), 974 states have internal predecessors, (1431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1435 transitions. [2022-04-08 08:56:15,567 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1435 transitions. Word has length 156 [2022-04-08 08:56:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:56:15,567 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1435 transitions. [2022-04-08 08:56:15,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:15,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1435 transitions. [2022-04-08 08:56:17,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1435 edges. 1435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1435 transitions. [2022-04-08 08:56:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 08:56:17,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:56:17,024 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:56:17,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-08 08:56:17,025 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:56:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:56:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash 999372298, now seen corresponding path program 1 times [2022-04-08 08:56:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:17,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [768307210] [2022-04-08 08:56:17,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:56:17,119 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:56:17,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:56:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash 999372298, now seen corresponding path program 2 times [2022-04-08 08:56:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:56:17,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653069813] [2022-04-08 08:56:17,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:56:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:56:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:56:17,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:56:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:56:17,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {220109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {220103#true} is VALID [2022-04-08 08:56:17,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {220103#true} assume true; {220103#true} is VALID [2022-04-08 08:56:17,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220103#true} {220103#true} #708#return; {220103#true} is VALID [2022-04-08 08:56:17,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {220103#true} call ULTIMATE.init(); {220109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {220109#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {220103#true} assume true; {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220103#true} {220103#true} #708#return; {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {220103#true} call #t~ret161 := main(); {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {220103#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {220103#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L272 TraceCheckUtils]: 7: Hoare triple {220103#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {220103#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {220103#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {220103#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {220103#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {220103#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {220103#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {220103#true} assume !false; {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {220103#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {220103#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {220103#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {220103#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {220103#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {220103#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {220103#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {220103#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {220103#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {220103#true} assume 8464 == #t~mem55;havoc #t~mem55; {220103#true} is VALID [2022-04-08 08:56:17,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {220103#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {220103#true} is VALID [2022-04-08 08:56:17,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {220103#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !false; {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {220108#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:56:17,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {220108#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {220104#false} is VALID [2022-04-08 08:56:17,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {220104#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {220104#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {220104#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {220104#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {220104#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220104#false} is VALID [2022-04-08 08:56:17,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {220104#false} ~skip~0 := 0; {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {220104#false} assume !false; {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {220104#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {220104#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {220104#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {220104#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {220104#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 59: Hoare triple {220104#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 60: Hoare triple {220104#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {220104#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 62: Hoare triple {220104#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 63: Hoare triple {220104#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 64: Hoare triple {220104#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 65: Hoare triple {220104#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,301 INFO L290 TraceCheckUtils]: 66: Hoare triple {220104#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {220104#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {220104#false} assume 8512 == #t~mem60;havoc #t~mem60; {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {220104#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 70: Hoare triple {220104#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 71: Hoare triple {220104#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 72: Hoare triple {220104#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 73: Hoare triple {220104#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 74: Hoare triple {220104#false} ~skip~0 := 0; {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 75: Hoare triple {220104#false} assume !false; {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 76: Hoare triple {220104#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 77: Hoare triple {220104#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 78: Hoare triple {220104#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 79: Hoare triple {220104#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {220104#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {220104#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 82: Hoare triple {220104#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 83: Hoare triple {220104#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 84: Hoare triple {220104#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {220104#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {220104#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 87: Hoare triple {220104#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {220104#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {220104#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {220104#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 91: Hoare triple {220104#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 92: Hoare triple {220104#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 93: Hoare triple {220104#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 94: Hoare triple {220104#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,303 INFO L290 TraceCheckUtils]: 95: Hoare triple {220104#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 96: Hoare triple {220104#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 97: Hoare triple {220104#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 98: Hoare triple {220104#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 99: Hoare triple {220104#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 100: Hoare triple {220104#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 101: Hoare triple {220104#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 102: Hoare triple {220104#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 103: Hoare triple {220104#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 104: Hoare triple {220104#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 105: Hoare triple {220104#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 106: Hoare triple {220104#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 107: Hoare triple {220104#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 108: Hoare triple {220104#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 109: Hoare triple {220104#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,304 INFO L290 TraceCheckUtils]: 110: Hoare triple {220104#false} assume 8673 == #t~mem80;havoc #t~mem80; {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 111: Hoare triple {220104#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 112: Hoare triple {220104#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {220104#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 114: Hoare triple {220104#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 115: Hoare triple {220104#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 116: Hoare triple {220104#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 117: Hoare triple {220104#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 118: Hoare triple {220104#false} ~skip~0 := 0; {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 119: Hoare triple {220104#false} assume !false; {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 120: Hoare triple {220104#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 121: Hoare triple {220104#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,305 INFO L290 TraceCheckUtils]: 122: Hoare triple {220104#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 123: Hoare triple {220104#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 124: Hoare triple {220104#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 125: Hoare triple {220104#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 126: Hoare triple {220104#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 127: Hoare triple {220104#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 128: Hoare triple {220104#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 129: Hoare triple {220104#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 130: Hoare triple {220104#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 131: Hoare triple {220104#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,306 INFO L290 TraceCheckUtils]: 132: Hoare triple {220104#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 133: Hoare triple {220104#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 134: Hoare triple {220104#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 135: Hoare triple {220104#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 136: Hoare triple {220104#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 137: Hoare triple {220104#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 138: Hoare triple {220104#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 139: Hoare triple {220104#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 140: Hoare triple {220104#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 141: Hoare triple {220104#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,307 INFO L290 TraceCheckUtils]: 142: Hoare triple {220104#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 143: Hoare triple {220104#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 144: Hoare triple {220104#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 145: Hoare triple {220104#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 146: Hoare triple {220104#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 147: Hoare triple {220104#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 148: Hoare triple {220104#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 149: Hoare triple {220104#false} assume 8640 == #t~mem75;havoc #t~mem75; {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 150: Hoare triple {220104#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 151: Hoare triple {220104#false} assume !(4 == ~blastFlag~0); {220104#false} is VALID [2022-04-08 08:56:17,308 INFO L290 TraceCheckUtils]: 152: Hoare triple {220104#false} assume !(7 == ~blastFlag~0); {220104#false} is VALID [2022-04-08 08:56:17,309 INFO L290 TraceCheckUtils]: 153: Hoare triple {220104#false} assume !(10 == ~blastFlag~0); {220104#false} is VALID [2022-04-08 08:56:17,309 INFO L290 TraceCheckUtils]: 154: Hoare triple {220104#false} assume 13 == ~blastFlag~0; {220104#false} is VALID [2022-04-08 08:56:17,309 INFO L290 TraceCheckUtils]: 155: Hoare triple {220104#false} assume !false; {220104#false} is VALID [2022-04-08 08:56:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 08:56:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:56:17,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653069813] [2022-04-08 08:56:17,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653069813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:56:17,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:56:17,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:56:17,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:56:17,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [768307210] [2022-04-08 08:56:17,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [768307210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:56:17,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:56:17,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:56:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802971362] [2022-04-08 08:56:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:56:17,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 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 156 [2022-04-08 08:56:17,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:56:17,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 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-08 08:56:17,383 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-08 08:56:17,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:56:17,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:17,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:56:17,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:56:17,384 INFO L87 Difference]: Start difference. First operand 979 states and 1435 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 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-08 08:56:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:29,266 INFO L93 Difference]: Finished difference Result 1957 states and 2875 transitions. [2022-04-08 08:56:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:56:29,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 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 156 [2022-04-08 08:56:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:56:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 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-08 08:56:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-08 08:56:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 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-08 08:56:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-08 08:56:29,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 464 transitions. [2022-04-08 08:56:29,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:29,609 INFO L225 Difference]: With dead ends: 1957 [2022-04-08 08:56:29,609 INFO L226 Difference]: Without dead ends: 1006 [2022-04-08 08:56:29,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:56:29,610 INFO L913 BasicCegarLoop]: 230 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:56:29,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 424 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 08:56:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2022-04-08 08:56:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2022-04-08 08:56:29,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:56:29,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1006 states. Second operand has 1006 states, 1001 states have (on average 1.4645354645354645) internal successors, (1466), 1001 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:29,665 INFO L74 IsIncluded]: Start isIncluded. First operand 1006 states. Second operand has 1006 states, 1001 states have (on average 1.4645354645354645) internal successors, (1466), 1001 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:29,666 INFO L87 Difference]: Start difference. First operand 1006 states. Second operand has 1006 states, 1001 states have (on average 1.4645354645354645) internal successors, (1466), 1001 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:29,692 INFO L93 Difference]: Finished difference Result 1006 states and 1470 transitions. [2022-04-08 08:56:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1470 transitions. [2022-04-08 08:56:29,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:29,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:29,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 1006 states, 1001 states have (on average 1.4645354645354645) internal successors, (1466), 1001 states have internal predecessors, (1466), 3 states have call successors, (3), 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 1006 states. [2022-04-08 08:56:29,694 INFO L87 Difference]: Start difference. First operand has 1006 states, 1001 states have (on average 1.4645354645354645) internal successors, (1466), 1001 states have internal predecessors, (1466), 3 states have call successors, (3), 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 1006 states. [2022-04-08 08:56:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:29,722 INFO L93 Difference]: Finished difference Result 1006 states and 1470 transitions. [2022-04-08 08:56:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1470 transitions. [2022-04-08 08:56:29,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:29,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:29,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:56:29,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:56:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1001 states have (on average 1.4645354645354645) internal successors, (1466), 1001 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1470 transitions. [2022-04-08 08:56:29,762 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1470 transitions. Word has length 156 [2022-04-08 08:56:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:56:29,762 INFO L478 AbstractCegarLoop]: Abstraction has 1006 states and 1470 transitions. [2022-04-08 08:56:29,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 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-08 08:56:29,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1006 states and 1470 transitions. [2022-04-08 08:56:31,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1470 edges. 1470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1470 transitions. [2022-04-08 08:56:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-08 08:56:31,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:56:31,264 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:56:31,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-08 08:56:31,264 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:56:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:56:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1776405232, now seen corresponding path program 1 times [2022-04-08 08:56:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:31,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [162358678] [2022-04-08 08:56:31,364 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:56:31,364 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:56:31,364 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:56:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1776405232, now seen corresponding path program 2 times [2022-04-08 08:56:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:56:31,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082159794] [2022-04-08 08:56:31,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:56:31,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:56:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:56:31,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:56:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:56:31,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {228056#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {228050#true} is VALID [2022-04-08 08:56:31,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {228050#true} assume true; {228050#true} is VALID [2022-04-08 08:56:31,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228050#true} {228050#true} #708#return; {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {228050#true} call ULTIMATE.init(); {228056#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {228056#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {228050#true} assume true; {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228050#true} {228050#true} #708#return; {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {228050#true} call #t~ret161 := main(); {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {228050#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {228050#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L272 TraceCheckUtils]: 7: Hoare triple {228050#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {228050#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {228050#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {228050#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {228050#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {228050#true} is VALID [2022-04-08 08:56:31,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {228050#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {228050#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {228050#true} assume !false; {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {228050#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {228050#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {228050#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {228050#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {228050#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {228050#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {228050#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {228050#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {228050#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {228050#true} assume 8464 == #t~mem55;havoc #t~mem55; {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {228050#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {228050#true} is VALID [2022-04-08 08:56:31,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {228050#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {228050#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {228050#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {228050#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {228050#true} ~skip~0 := 0; {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {228050#true} assume !false; {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {228050#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {228050#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {228050#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {228050#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {228050#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {228050#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {228050#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {228050#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {228050#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {228050#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {228050#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {228050#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {228050#true} assume 8496 == #t~mem58;havoc #t~mem58; {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {228050#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {228050#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {228050#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {228050#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {228050#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {228050#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {228050#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {228050#true} is VALID [2022-04-08 08:56:31,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {228050#true} ~skip~0 := 0; {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {228050#true} assume !false; {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {228050#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 55: Hoare triple {228050#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {228050#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {228050#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {228050#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {228050#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {228050#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {228050#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 62: Hoare triple {228050#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {228050#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 64: Hoare triple {228050#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {228050#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 66: Hoare triple {228050#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 67: Hoare triple {228050#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {228050#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 69: Hoare triple {228050#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {228050#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {228050#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {228050#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 73: Hoare triple {228050#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 74: Hoare triple {228050#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 75: Hoare triple {228050#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 76: Hoare triple {228050#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 77: Hoare triple {228050#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,589 INFO L290 TraceCheckUtils]: 78: Hoare triple {228050#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 79: Hoare triple {228050#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 80: Hoare triple {228050#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 81: Hoare triple {228050#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 82: Hoare triple {228050#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 83: Hoare triple {228050#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 84: Hoare triple {228050#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 85: Hoare triple {228050#true} assume 8656 == #t~mem77;havoc #t~mem77; {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 86: Hoare triple {228050#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 87: Hoare triple {228050#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 88: Hoare triple {228050#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 89: Hoare triple {228050#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 90: Hoare triple {228050#true} assume !(0 == ~tmp___10~0); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 91: Hoare triple {228050#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,590 INFO L290 TraceCheckUtils]: 92: Hoare triple {228050#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 93: Hoare triple {228050#true} ~skip~0 := 0; {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 94: Hoare triple {228050#true} assume !false; {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 95: Hoare triple {228050#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {228050#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 97: Hoare triple {228050#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 98: Hoare triple {228050#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 99: Hoare triple {228050#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 100: Hoare triple {228050#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 101: Hoare triple {228050#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 102: Hoare triple {228050#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 103: Hoare triple {228050#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 104: Hoare triple {228050#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 105: Hoare triple {228050#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,591 INFO L290 TraceCheckUtils]: 106: Hoare triple {228050#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 107: Hoare triple {228050#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 108: Hoare triple {228050#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 109: Hoare triple {228050#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 110: Hoare triple {228050#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 111: Hoare triple {228050#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 112: Hoare triple {228050#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 113: Hoare triple {228050#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 114: Hoare triple {228050#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 115: Hoare triple {228050#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,592 INFO L290 TraceCheckUtils]: 116: Hoare triple {228050#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 117: Hoare triple {228050#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 118: Hoare triple {228050#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 119: Hoare triple {228050#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 120: Hoare triple {228050#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 121: Hoare triple {228050#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 122: Hoare triple {228050#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 123: Hoare triple {228050#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 124: Hoare triple {228050#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 125: Hoare triple {228050#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,593 INFO L290 TraceCheckUtils]: 126: Hoare triple {228050#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,594 INFO L290 TraceCheckUtils]: 127: Hoare triple {228050#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {228050#true} is VALID [2022-04-08 08:56:31,594 INFO L290 TraceCheckUtils]: 128: Hoare triple {228050#true} assume 8672 == #t~mem79;havoc #t~mem79; {228050#true} is VALID [2022-04-08 08:56:31,594 INFO L290 TraceCheckUtils]: 129: Hoare triple {228050#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {228050#true} is VALID [2022-04-08 08:56:31,595 INFO L290 TraceCheckUtils]: 130: Hoare triple {228050#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,596 INFO L290 TraceCheckUtils]: 131: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,596 INFO L290 TraceCheckUtils]: 132: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,597 INFO L290 TraceCheckUtils]: 133: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,597 INFO L290 TraceCheckUtils]: 134: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,598 INFO L290 TraceCheckUtils]: 135: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,598 INFO L290 TraceCheckUtils]: 136: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} ~skip~0 := 0; {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,598 INFO L290 TraceCheckUtils]: 137: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !false; {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,599 INFO L290 TraceCheckUtils]: 138: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,599 INFO L290 TraceCheckUtils]: 139: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,600 INFO L290 TraceCheckUtils]: 140: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,600 INFO L290 TraceCheckUtils]: 141: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,600 INFO L290 TraceCheckUtils]: 142: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,601 INFO L290 TraceCheckUtils]: 143: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,601 INFO L290 TraceCheckUtils]: 144: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,601 INFO L290 TraceCheckUtils]: 145: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,602 INFO L290 TraceCheckUtils]: 146: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,602 INFO L290 TraceCheckUtils]: 147: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,602 INFO L290 TraceCheckUtils]: 148: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,603 INFO L290 TraceCheckUtils]: 149: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,603 INFO L290 TraceCheckUtils]: 150: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,603 INFO L290 TraceCheckUtils]: 151: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,604 INFO L290 TraceCheckUtils]: 152: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,604 INFO L290 TraceCheckUtils]: 153: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,604 INFO L290 TraceCheckUtils]: 154: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,605 INFO L290 TraceCheckUtils]: 155: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,605 INFO L290 TraceCheckUtils]: 156: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,605 INFO L290 TraceCheckUtils]: 157: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,606 INFO L290 TraceCheckUtils]: 158: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,606 INFO L290 TraceCheckUtils]: 159: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,606 INFO L290 TraceCheckUtils]: 160: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,607 INFO L290 TraceCheckUtils]: 161: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,607 INFO L290 TraceCheckUtils]: 162: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,607 INFO L290 TraceCheckUtils]: 163: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,608 INFO L290 TraceCheckUtils]: 164: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,608 INFO L290 TraceCheckUtils]: 165: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,608 INFO L290 TraceCheckUtils]: 166: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,609 INFO L290 TraceCheckUtils]: 167: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume 8640 == #t~mem75;havoc #t~mem75; {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,609 INFO L290 TraceCheckUtils]: 168: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {228055#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-08 08:56:31,609 INFO L290 TraceCheckUtils]: 169: Hoare triple {228055#(= ssl3_accept_~blastFlag~0 4)} assume !(4 == ~blastFlag~0); {228051#false} is VALID [2022-04-08 08:56:31,609 INFO L290 TraceCheckUtils]: 170: Hoare triple {228051#false} assume !(7 == ~blastFlag~0); {228051#false} is VALID [2022-04-08 08:56:31,609 INFO L290 TraceCheckUtils]: 171: Hoare triple {228051#false} assume !(10 == ~blastFlag~0); {228051#false} is VALID [2022-04-08 08:56:31,609 INFO L290 TraceCheckUtils]: 172: Hoare triple {228051#false} assume 13 == ~blastFlag~0; {228051#false} is VALID [2022-04-08 08:56:31,609 INFO L290 TraceCheckUtils]: 173: Hoare triple {228051#false} assume !false; {228051#false} is VALID [2022-04-08 08:56:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-08 08:56:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:56:31,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082159794] [2022-04-08 08:56:31,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082159794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:56:31,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:56:31,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:56:31,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:56:31,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [162358678] [2022-04-08 08:56:31,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [162358678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:56:31,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:56:31,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:56:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16662450] [2022-04-08 08:56:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:56:31,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 174 [2022-04-08 08:56:31,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:56:31,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:31,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:31,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:56:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:56:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:56:31,687 INFO L87 Difference]: Start difference. First operand 1006 states and 1470 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:42,377 INFO L93 Difference]: Finished difference Result 2474 states and 3637 transitions. [2022-04-08 08:56:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:56:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 174 [2022-04-08 08:56:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:56:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-08 08:56:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-08 08:56:42,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 620 transitions. [2022-04-08 08:56:42,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:42,882 INFO L225 Difference]: With dead ends: 2474 [2022-04-08 08:56:42,882 INFO L226 Difference]: Without dead ends: 1496 [2022-04-08 08:56:42,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:56:42,883 INFO L913 BasicCegarLoop]: 390 mSDtfsCounter, 143 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:56:42,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 584 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-08 08:56:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-04-08 08:56:42,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2022-04-08 08:56:42,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:56:42,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1496 states. Second operand has 1496 states, 1491 states have (on average 1.4647887323943662) internal successors, (2184), 1491 states have internal predecessors, (2184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:42,966 INFO L74 IsIncluded]: Start isIncluded. First operand 1496 states. Second operand has 1496 states, 1491 states have (on average 1.4647887323943662) internal successors, (2184), 1491 states have internal predecessors, (2184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:42,967 INFO L87 Difference]: Start difference. First operand 1496 states. Second operand has 1496 states, 1491 states have (on average 1.4647887323943662) internal successors, (2184), 1491 states have internal predecessors, (2184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:43,020 INFO L93 Difference]: Finished difference Result 1496 states and 2188 transitions. [2022-04-08 08:56:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2188 transitions. [2022-04-08 08:56:43,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:43,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:43,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 1496 states, 1491 states have (on average 1.4647887323943662) internal successors, (2184), 1491 states have internal predecessors, (2184), 3 states have call successors, (3), 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 1496 states. [2022-04-08 08:56:43,023 INFO L87 Difference]: Start difference. First operand has 1496 states, 1491 states have (on average 1.4647887323943662) internal successors, (2184), 1491 states have internal predecessors, (2184), 3 states have call successors, (3), 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 1496 states. [2022-04-08 08:56:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:43,076 INFO L93 Difference]: Finished difference Result 1496 states and 2188 transitions. [2022-04-08 08:56:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2188 transitions. [2022-04-08 08:56:43,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:43,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:43,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:56:43,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:56:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1491 states have (on average 1.4647887323943662) internal successors, (2184), 1491 states have internal predecessors, (2184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2188 transitions. [2022-04-08 08:56:43,169 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2188 transitions. Word has length 174 [2022-04-08 08:56:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:56:43,169 INFO L478 AbstractCegarLoop]: Abstraction has 1496 states and 2188 transitions. [2022-04-08 08:56:43,170 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:43,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1496 states and 2188 transitions. [2022-04-08 08:56:45,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2188 edges. 2188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2188 transitions. [2022-04-08 08:56:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-08 08:56:45,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:56:45,455 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:56:45,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-08 08:56:45,455 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:56:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:56:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash -309724723, now seen corresponding path program 1 times [2022-04-08 08:56:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:45,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [885075403] [2022-04-08 08:56:45,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:56:45,570 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:56:45,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:56:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash -309724723, now seen corresponding path program 2 times [2022-04-08 08:56:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:56:45,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500546243] [2022-04-08 08:56:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:56:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:56:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:56:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:56:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:56:45,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {238997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {238991#true} is VALID [2022-04-08 08:56:45,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {238991#true} assume true; {238991#true} is VALID [2022-04-08 08:56:45,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238991#true} {238991#true} #708#return; {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {238991#true} call ULTIMATE.init(); {238997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:56:45,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {238997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {238991#true} assume true; {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238991#true} {238991#true} #708#return; {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {238991#true} call #t~ret161 := main(); {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {238991#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {238991#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L272 TraceCheckUtils]: 7: Hoare triple {238991#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {238991#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {238991#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {238991#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {238991#true} is VALID [2022-04-08 08:56:45,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {238991#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {238991#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {238991#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {238991#true} assume !false; {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {238991#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {238991#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {238991#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {238991#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {238991#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {238991#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {238991#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {238991#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {238991#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {238991#true} assume 8464 == #t~mem55;havoc #t~mem55; {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {238991#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {238991#true} is VALID [2022-04-08 08:56:45,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {238991#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {238991#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {238991#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {238991#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {238991#true} ~skip~0 := 0; {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {238991#true} assume !false; {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {238991#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {238991#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {238991#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {238991#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {238991#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {238991#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {238991#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {238991#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {238991#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {238991#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {238991#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {238991#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {238991#true} assume 8496 == #t~mem58;havoc #t~mem58; {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {238991#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {238991#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {238991#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {238991#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 49: Hoare triple {238991#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {238991#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {238991#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {238991#true} ~skip~0 := 0; {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 53: Hoare triple {238991#true} assume !false; {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 54: Hoare triple {238991#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {238991#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {238991#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {238991#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {238991#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 59: Hoare triple {238991#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 60: Hoare triple {238991#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {238991#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {238991#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {238991#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 64: Hoare triple {238991#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {238991#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 66: Hoare triple {238991#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {238991#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {238991#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {238991#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 70: Hoare triple {238991#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,791 INFO L290 TraceCheckUtils]: 71: Hoare triple {238991#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {238991#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {238991#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 74: Hoare triple {238991#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {238991#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {238991#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 77: Hoare triple {238991#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 78: Hoare triple {238991#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 79: Hoare triple {238991#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 80: Hoare triple {238991#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 81: Hoare triple {238991#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 82: Hoare triple {238991#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 83: Hoare triple {238991#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 84: Hoare triple {238991#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 85: Hoare triple {238991#true} assume 8656 == #t~mem77;havoc #t~mem77; {238991#true} is VALID [2022-04-08 08:56:45,792 INFO L290 TraceCheckUtils]: 86: Hoare triple {238991#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {238991#true} is VALID [2022-04-08 08:56:45,793 INFO L290 TraceCheckUtils]: 87: Hoare triple {238991#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {238991#true} is VALID [2022-04-08 08:56:45,793 INFO L290 TraceCheckUtils]: 88: Hoare triple {238991#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,793 INFO L290 TraceCheckUtils]: 89: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,793 INFO L290 TraceCheckUtils]: 90: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,794 INFO L290 TraceCheckUtils]: 91: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,794 INFO L290 TraceCheckUtils]: 92: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,794 INFO L290 TraceCheckUtils]: 93: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,794 INFO L290 TraceCheckUtils]: 94: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !false; {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,795 INFO L290 TraceCheckUtils]: 95: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,795 INFO L290 TraceCheckUtils]: 96: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,795 INFO L290 TraceCheckUtils]: 97: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,796 INFO L290 TraceCheckUtils]: 99: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,797 INFO L290 TraceCheckUtils]: 102: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,797 INFO L290 TraceCheckUtils]: 103: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,797 INFO L290 TraceCheckUtils]: 104: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,798 INFO L290 TraceCheckUtils]: 106: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,798 INFO L290 TraceCheckUtils]: 107: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,798 INFO L290 TraceCheckUtils]: 108: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,798 INFO L290 TraceCheckUtils]: 109: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,799 INFO L290 TraceCheckUtils]: 110: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,799 INFO L290 TraceCheckUtils]: 111: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,799 INFO L290 TraceCheckUtils]: 112: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,800 INFO L290 TraceCheckUtils]: 113: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,800 INFO L290 TraceCheckUtils]: 114: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,800 INFO L290 TraceCheckUtils]: 115: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,800 INFO L290 TraceCheckUtils]: 116: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,801 INFO L290 TraceCheckUtils]: 117: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,801 INFO L290 TraceCheckUtils]: 118: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,801 INFO L290 TraceCheckUtils]: 119: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,802 INFO L290 TraceCheckUtils]: 120: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,802 INFO L290 TraceCheckUtils]: 121: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,802 INFO L290 TraceCheckUtils]: 122: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,802 INFO L290 TraceCheckUtils]: 123: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,803 INFO L290 TraceCheckUtils]: 124: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,803 INFO L290 TraceCheckUtils]: 125: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,803 INFO L290 TraceCheckUtils]: 126: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,803 INFO L290 TraceCheckUtils]: 127: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,804 INFO L290 TraceCheckUtils]: 128: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem79;havoc #t~mem79; {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,804 INFO L290 TraceCheckUtils]: 129: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {238996#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:56:45,804 INFO L290 TraceCheckUtils]: 130: Hoare triple {238996#(= 3 ssl3_accept_~blastFlag~0)} assume !(3 == ~blastFlag~0); {238992#false} is VALID [2022-04-08 08:56:45,804 INFO L290 TraceCheckUtils]: 131: Hoare triple {238992#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {238992#false} is VALID [2022-04-08 08:56:45,804 INFO L290 TraceCheckUtils]: 132: Hoare triple {238992#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,804 INFO L290 TraceCheckUtils]: 133: Hoare triple {238992#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 134: Hoare triple {238992#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 135: Hoare triple {238992#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 136: Hoare triple {238992#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 137: Hoare triple {238992#false} ~skip~0 := 0; {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 138: Hoare triple {238992#false} assume !false; {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 139: Hoare triple {238992#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 140: Hoare triple {238992#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 141: Hoare triple {238992#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 142: Hoare triple {238992#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 143: Hoare triple {238992#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 144: Hoare triple {238992#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 145: Hoare triple {238992#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 146: Hoare triple {238992#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 147: Hoare triple {238992#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,805 INFO L290 TraceCheckUtils]: 148: Hoare triple {238992#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 149: Hoare triple {238992#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 150: Hoare triple {238992#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 151: Hoare triple {238992#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 152: Hoare triple {238992#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 153: Hoare triple {238992#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 154: Hoare triple {238992#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 155: Hoare triple {238992#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 156: Hoare triple {238992#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 157: Hoare triple {238992#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 158: Hoare triple {238992#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 159: Hoare triple {238992#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 160: Hoare triple {238992#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 161: Hoare triple {238992#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 162: Hoare triple {238992#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,806 INFO L290 TraceCheckUtils]: 163: Hoare triple {238992#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 164: Hoare triple {238992#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 165: Hoare triple {238992#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 166: Hoare triple {238992#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 167: Hoare triple {238992#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 168: Hoare triple {238992#false} assume 8640 == #t~mem75;havoc #t~mem75; {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 169: Hoare triple {238992#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 170: Hoare triple {238992#false} assume !(4 == ~blastFlag~0); {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 171: Hoare triple {238992#false} assume !(7 == ~blastFlag~0); {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 172: Hoare triple {238992#false} assume !(10 == ~blastFlag~0); {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 173: Hoare triple {238992#false} assume 13 == ~blastFlag~0; {238992#false} is VALID [2022-04-08 08:56:45,807 INFO L290 TraceCheckUtils]: 174: Hoare triple {238992#false} assume !false; {238992#false} is VALID [2022-04-08 08:56:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 08:56:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:56:45,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500546243] [2022-04-08 08:56:45,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500546243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:56:45,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:56:45,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:56:45,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:56:45,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [885075403] [2022-04-08 08:56:45,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [885075403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:56:45,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:56:45,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:56:45,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82684231] [2022-04-08 08:56:45,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:56:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 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 175 [2022-04-08 08:56:45,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:56:45,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:45,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:45,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:56:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:45,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:56:45,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:56:45,915 INFO L87 Difference]: Start difference. First operand 1496 states and 2188 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:59,267 INFO L93 Difference]: Finished difference Result 3422 states and 5025 transitions. [2022-04-08 08:56:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:56:59,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 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 175 [2022-04-08 08:56:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:56:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-08 08:56:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-08 08:56:59,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 620 transitions. [2022-04-08 08:56:59,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:59,830 INFO L225 Difference]: With dead ends: 3422 [2022-04-08 08:56:59,830 INFO L226 Difference]: Without dead ends: 1954 [2022-04-08 08:56:59,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:56:59,832 INFO L913 BasicCegarLoop]: 383 mSDtfsCounter, 140 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:56:59,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 577 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-08 08:56:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-04-08 08:56:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1954. [2022-04-08 08:56:59,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:56:59,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1954 states. Second operand has 1954 states, 1949 states have (on average 1.4643406875320677) internal successors, (2854), 1949 states have internal predecessors, (2854), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:59,951 INFO L74 IsIncluded]: Start isIncluded. First operand 1954 states. Second operand has 1954 states, 1949 states have (on average 1.4643406875320677) internal successors, (2854), 1949 states have internal predecessors, (2854), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:59,952 INFO L87 Difference]: Start difference. First operand 1954 states. Second operand has 1954 states, 1949 states have (on average 1.4643406875320677) internal successors, (2854), 1949 states have internal predecessors, (2854), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:57:00,051 INFO L93 Difference]: Finished difference Result 1954 states and 2858 transitions. [2022-04-08 08:57:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2858 transitions. [2022-04-08 08:57:00,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:57:00,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:57:00,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 1954 states, 1949 states have (on average 1.4643406875320677) internal successors, (2854), 1949 states have internal predecessors, (2854), 3 states have call successors, (3), 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 1954 states. [2022-04-08 08:57:00,055 INFO L87 Difference]: Start difference. First operand has 1954 states, 1949 states have (on average 1.4643406875320677) internal successors, (2854), 1949 states have internal predecessors, (2854), 3 states have call successors, (3), 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 1954 states. [2022-04-08 08:57:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:57:00,151 INFO L93 Difference]: Finished difference Result 1954 states and 2858 transitions. [2022-04-08 08:57:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2858 transitions. [2022-04-08 08:57:00,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:57:00,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:57:00,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:57:00,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:57:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1949 states have (on average 1.4643406875320677) internal successors, (2854), 1949 states have internal predecessors, (2854), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2858 transitions. [2022-04-08 08:57:00,322 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2858 transitions. Word has length 175 [2022-04-08 08:57:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:57:00,322 INFO L478 AbstractCegarLoop]: Abstraction has 1954 states and 2858 transitions. [2022-04-08 08:57:00,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:00,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1954 states and 2858 transitions. [2022-04-08 08:57:03,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2858 edges. 2858 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:57:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2858 transitions. [2022-04-08 08:57:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-04-08 08:57:03,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:57:03,270 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:57:03,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-08 08:57:03,270 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:57:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:57:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -668221088, now seen corresponding path program 1 times [2022-04-08 08:57:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:57:03,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309944066] [2022-04-08 08:57:38,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:57:38,545 INFO L85 PathProgramCache]: Analyzing trace with hash -668221088, now seen corresponding path program 2 times [2022-04-08 08:57:38,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:57:38,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538243370] [2022-04-08 08:57:38,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:57:38,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:57:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:57:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:57:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:57:38,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {253666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {253660#true} is VALID [2022-04-08 08:57:38,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {253660#true} assume true; {253660#true} is VALID [2022-04-08 08:57:38,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {253660#true} {253660#true} #708#return; {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {253660#true} call ULTIMATE.init(); {253666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {253666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {253660#true} assume true; {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {253660#true} {253660#true} #708#return; {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {253660#true} call #t~ret161 := main(); {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {253660#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {253660#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L272 TraceCheckUtils]: 7: Hoare triple {253660#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {253660#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {253660#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {253660#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {253660#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {253660#true} is VALID [2022-04-08 08:57:38,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {253660#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {253660#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {253660#true} assume !false; {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {253660#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {253660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {253660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {253660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {253660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {253660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {253660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {253660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {253660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {253660#true} assume 8464 == #t~mem55;havoc #t~mem55; {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {253660#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {253660#true} is VALID [2022-04-08 08:57:38,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {253660#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {253660#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {253660#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {253660#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {253660#true} ~skip~0 := 0; {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {253660#true} assume !false; {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {253660#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {253660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {253660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {253660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {253660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {253660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {253660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {253660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {253660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {253660#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {253660#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {253660#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {253660#true} assume 8496 == #t~mem58;havoc #t~mem58; {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {253660#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {253660#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {253660#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {253660#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {253660#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {253660#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {253660#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {253660#true} ~skip~0 := 0; {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {253660#true} assume !false; {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {253660#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {253660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {253660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {253660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {253660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {253660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {253660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {253660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {253660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {253660#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {253660#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {253660#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {253660#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 67: Hoare triple {253660#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {253660#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 69: Hoare triple {253660#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 70: Hoare triple {253660#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,764 INFO L290 TraceCheckUtils]: 71: Hoare triple {253660#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {253660#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {253660#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {253660#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {253660#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {253660#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 77: Hoare triple {253660#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 78: Hoare triple {253660#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 79: Hoare triple {253660#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 80: Hoare triple {253660#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 81: Hoare triple {253660#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 82: Hoare triple {253660#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 83: Hoare triple {253660#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 84: Hoare triple {253660#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 85: Hoare triple {253660#true} assume 8656 == #t~mem77;havoc #t~mem77; {253660#true} is VALID [2022-04-08 08:57:38,765 INFO L290 TraceCheckUtils]: 86: Hoare triple {253660#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 87: Hoare triple {253660#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 88: Hoare triple {253660#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 89: Hoare triple {253660#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 90: Hoare triple {253660#true} assume !(0 == ~tmp___10~0); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 91: Hoare triple {253660#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 92: Hoare triple {253660#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 93: Hoare triple {253660#true} ~skip~0 := 0; {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 94: Hoare triple {253660#true} assume !false; {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 95: Hoare triple {253660#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 96: Hoare triple {253660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 97: Hoare triple {253660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 98: Hoare triple {253660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 99: Hoare triple {253660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 100: Hoare triple {253660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,766 INFO L290 TraceCheckUtils]: 101: Hoare triple {253660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 102: Hoare triple {253660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 103: Hoare triple {253660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 104: Hoare triple {253660#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 105: Hoare triple {253660#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 106: Hoare triple {253660#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 107: Hoare triple {253660#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 108: Hoare triple {253660#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 109: Hoare triple {253660#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 110: Hoare triple {253660#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 111: Hoare triple {253660#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 112: Hoare triple {253660#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 113: Hoare triple {253660#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 114: Hoare triple {253660#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,767 INFO L290 TraceCheckUtils]: 115: Hoare triple {253660#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 116: Hoare triple {253660#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 117: Hoare triple {253660#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 118: Hoare triple {253660#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 119: Hoare triple {253660#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 120: Hoare triple {253660#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 121: Hoare triple {253660#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 122: Hoare triple {253660#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 123: Hoare triple {253660#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 124: Hoare triple {253660#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 125: Hoare triple {253660#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 126: Hoare triple {253660#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 127: Hoare triple {253660#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 128: Hoare triple {253660#true} assume 8672 == #t~mem79;havoc #t~mem79; {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 129: Hoare triple {253660#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {253660#true} is VALID [2022-04-08 08:57:38,768 INFO L290 TraceCheckUtils]: 130: Hoare triple {253660#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 131: Hoare triple {253660#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 132: Hoare triple {253660#true} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 133: Hoare triple {253660#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 134: Hoare triple {253660#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 135: Hoare triple {253660#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 136: Hoare triple {253660#true} ~skip~0 := 0; {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 137: Hoare triple {253660#true} assume !false; {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 138: Hoare triple {253660#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 139: Hoare triple {253660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 140: Hoare triple {253660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 141: Hoare triple {253660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 142: Hoare triple {253660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 143: Hoare triple {253660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,769 INFO L290 TraceCheckUtils]: 144: Hoare triple {253660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 145: Hoare triple {253660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 146: Hoare triple {253660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 147: Hoare triple {253660#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 148: Hoare triple {253660#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 149: Hoare triple {253660#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 150: Hoare triple {253660#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 151: Hoare triple {253660#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 152: Hoare triple {253660#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 153: Hoare triple {253660#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 154: Hoare triple {253660#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 155: Hoare triple {253660#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 156: Hoare triple {253660#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 157: Hoare triple {253660#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 158: Hoare triple {253660#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,770 INFO L290 TraceCheckUtils]: 159: Hoare triple {253660#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 160: Hoare triple {253660#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 161: Hoare triple {253660#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 162: Hoare triple {253660#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 163: Hoare triple {253660#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 164: Hoare triple {253660#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 165: Hoare triple {253660#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 166: Hoare triple {253660#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 167: Hoare triple {253660#true} assume 8640 == #t~mem75;havoc #t~mem75; {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 168: Hoare triple {253660#true} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {253660#true} is VALID [2022-04-08 08:57:38,771 INFO L290 TraceCheckUtils]: 169: Hoare triple {253660#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,772 INFO L290 TraceCheckUtils]: 170: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(~ret~0 <= 0);call #t~mem139 := read~int(~s.base, 92 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,772 INFO L290 TraceCheckUtils]: 171: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume 0 != #t~mem139;havoc #t~mem139;call write~int(3, ~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,772 INFO L290 TraceCheckUtils]: 172: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,772 INFO L290 TraceCheckUtils]: 173: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,773 INFO L290 TraceCheckUtils]: 174: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,773 INFO L290 TraceCheckUtils]: 175: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,773 INFO L290 TraceCheckUtils]: 176: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,774 INFO L290 TraceCheckUtils]: 177: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,774 INFO L290 TraceCheckUtils]: 178: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,774 INFO L290 TraceCheckUtils]: 179: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,774 INFO L290 TraceCheckUtils]: 180: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,775 INFO L290 TraceCheckUtils]: 181: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,775 INFO L290 TraceCheckUtils]: 182: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,775 INFO L290 TraceCheckUtils]: 183: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,776 INFO L290 TraceCheckUtils]: 184: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,776 INFO L290 TraceCheckUtils]: 185: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,776 INFO L290 TraceCheckUtils]: 186: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,776 INFO L290 TraceCheckUtils]: 187: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,777 INFO L290 TraceCheckUtils]: 188: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,777 INFO L290 TraceCheckUtils]: 189: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,777 INFO L290 TraceCheckUtils]: 190: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,777 INFO L290 TraceCheckUtils]: 191: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,778 INFO L290 TraceCheckUtils]: 192: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,778 INFO L290 TraceCheckUtils]: 193: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,778 INFO L290 TraceCheckUtils]: 194: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,779 INFO L290 TraceCheckUtils]: 195: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,779 INFO L290 TraceCheckUtils]: 196: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,779 INFO L290 TraceCheckUtils]: 197: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,779 INFO L290 TraceCheckUtils]: 198: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,780 INFO L290 TraceCheckUtils]: 199: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,780 INFO L290 TraceCheckUtils]: 200: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,780 INFO L290 TraceCheckUtils]: 201: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,780 INFO L290 TraceCheckUtils]: 202: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,781 INFO L290 TraceCheckUtils]: 203: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,781 INFO L290 TraceCheckUtils]: 204: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,781 INFO L290 TraceCheckUtils]: 205: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,782 INFO L290 TraceCheckUtils]: 206: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,782 INFO L290 TraceCheckUtils]: 207: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,782 INFO L290 TraceCheckUtils]: 208: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,782 INFO L290 TraceCheckUtils]: 209: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,783 INFO L290 TraceCheckUtils]: 210: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,783 INFO L290 TraceCheckUtils]: 211: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume 8673 == #t~mem80;havoc #t~mem80; {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,783 INFO L290 TraceCheckUtils]: 212: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,783 INFO L290 TraceCheckUtils]: 213: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume !(3 == ~blastFlag~0); {253665#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 214: Hoare triple {253665#(<= ssl3_accept_~blastFlag~0 5)} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 215: Hoare triple {253661#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 216: Hoare triple {253661#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 217: Hoare triple {253661#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 218: Hoare triple {253661#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 219: Hoare triple {253661#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 220: Hoare triple {253661#false} ~skip~0 := 0; {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 221: Hoare triple {253661#false} assume !false; {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 222: Hoare triple {253661#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 223: Hoare triple {253661#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,784 INFO L290 TraceCheckUtils]: 224: Hoare triple {253661#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 225: Hoare triple {253661#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 226: Hoare triple {253661#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 227: Hoare triple {253661#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 228: Hoare triple {253661#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 229: Hoare triple {253661#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 230: Hoare triple {253661#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 231: Hoare triple {253661#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 232: Hoare triple {253661#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 233: Hoare triple {253661#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 234: Hoare triple {253661#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 235: Hoare triple {253661#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 236: Hoare triple {253661#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 237: Hoare triple {253661#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,785 INFO L290 TraceCheckUtils]: 238: Hoare triple {253661#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 239: Hoare triple {253661#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 240: Hoare triple {253661#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 241: Hoare triple {253661#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 242: Hoare triple {253661#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 243: Hoare triple {253661#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 244: Hoare triple {253661#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 245: Hoare triple {253661#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 246: Hoare triple {253661#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 247: Hoare triple {253661#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 248: Hoare triple {253661#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 249: Hoare triple {253661#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 250: Hoare triple {253661#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 251: Hoare triple {253661#false} assume 8640 == #t~mem75;havoc #t~mem75; {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 252: Hoare triple {253661#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {253661#false} is VALID [2022-04-08 08:57:38,786 INFO L290 TraceCheckUtils]: 253: Hoare triple {253661#false} assume !(4 == ~blastFlag~0); {253661#false} is VALID [2022-04-08 08:57:38,787 INFO L290 TraceCheckUtils]: 254: Hoare triple {253661#false} assume !(7 == ~blastFlag~0); {253661#false} is VALID [2022-04-08 08:57:38,787 INFO L290 TraceCheckUtils]: 255: Hoare triple {253661#false} assume !(10 == ~blastFlag~0); {253661#false} is VALID [2022-04-08 08:57:38,787 INFO L290 TraceCheckUtils]: 256: Hoare triple {253661#false} assume 13 == ~blastFlag~0; {253661#false} is VALID [2022-04-08 08:57:38,787 INFO L290 TraceCheckUtils]: 257: Hoare triple {253661#false} assume !false; {253661#false} is VALID [2022-04-08 08:57:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-08 08:57:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:57:38,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538243370] [2022-04-08 08:57:38,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538243370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:57:38,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:57:38,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:57:38,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:57:38,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309944066] [2022-04-08 08:57:38,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309944066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:57:38,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:57:38,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:57:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024910788] [2022-04-08 08:57:38,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:57:38,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 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 258 [2022-04-08 08:57:38,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:57:38,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:38,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:57:38,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:57:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:57:38,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:57:38,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:57:38,913 INFO L87 Difference]: Start difference. First operand 1954 states and 2858 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:40,974 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-08 08:57:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:57:46,309 INFO L93 Difference]: Finished difference Result 4377 states and 6424 transitions. [2022-04-08 08:57:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:57:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 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 258 [2022-04-08 08:57:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:57:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2022-04-08 08:57:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2022-04-08 08:57:46,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 630 transitions. [2022-04-08 08:57:46,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 630 edges. 630 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:57:46,968 INFO L225 Difference]: With dead ends: 4377 [2022-04-08 08:57:46,969 INFO L226 Difference]: Without dead ends: 2451 [2022-04-08 08:57:46,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:57:46,971 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 154 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:57:46,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 385 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:57:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2022-04-08 08:57:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2451. [2022-04-08 08:57:47,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:57:47,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2451 states. Second operand has 2451 states, 2446 states have (on average 1.4660670482420277) internal successors, (3586), 2446 states have internal predecessors, (3586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:47,976 INFO L74 IsIncluded]: Start isIncluded. First operand 2451 states. Second operand has 2451 states, 2446 states have (on average 1.4660670482420277) internal successors, (3586), 2446 states have internal predecessors, (3586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:47,977 INFO L87 Difference]: Start difference. First operand 2451 states. Second operand has 2451 states, 2446 states have (on average 1.4660670482420277) internal successors, (3586), 2446 states have internal predecessors, (3586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:57:48,122 INFO L93 Difference]: Finished difference Result 2451 states and 3590 transitions. [2022-04-08 08:57:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3590 transitions. [2022-04-08 08:57:48,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:57:48,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:57:48,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 2451 states, 2446 states have (on average 1.4660670482420277) internal successors, (3586), 2446 states have internal predecessors, (3586), 3 states have call successors, (3), 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 2451 states. [2022-04-08 08:57:48,128 INFO L87 Difference]: Start difference. First operand has 2451 states, 2446 states have (on average 1.4660670482420277) internal successors, (3586), 2446 states have internal predecessors, (3586), 3 states have call successors, (3), 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 2451 states. [2022-04-08 08:57:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:57:48,286 INFO L93 Difference]: Finished difference Result 2451 states and 3590 transitions. [2022-04-08 08:57:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3590 transitions. [2022-04-08 08:57:48,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:57:48,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:57:48,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:57:48,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:57:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2446 states have (on average 1.4660670482420277) internal successors, (3586), 2446 states have internal predecessors, (3586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3590 transitions. [2022-04-08 08:57:48,546 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3590 transitions. Word has length 258 [2022-04-08 08:57:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:57:48,546 INFO L478 AbstractCegarLoop]: Abstraction has 2451 states and 3590 transitions. [2022-04-08 08:57:48,546 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:48,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2451 states and 3590 transitions. [2022-04-08 08:57:52,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3590 edges. 3590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:57:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3590 transitions. [2022-04-08 08:57:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-04-08 08:57:52,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:57:52,399 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:57:52,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-08 08:57:52,400 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:57:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:57:52,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1515482758, now seen corresponding path program 1 times [2022-04-08 08:57:52,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:57:52,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026410174] [2022-04-08 08:58:04,501 WARN L232 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 467 DAG size of output: 311 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:58:53,833 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:58:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1515482758, now seen corresponding path program 2 times [2022-04-08 08:58:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:58:53,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833496713] [2022-04-08 08:58:53,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:58:53,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:58:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:58:54,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:58:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:58:54,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {272236#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {272227#true} is VALID [2022-04-08 08:58:54,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {272227#true} assume true; {272227#true} is VALID [2022-04-08 08:58:54,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {272227#true} {272227#true} #708#return; {272227#true} is VALID [2022-04-08 08:58:54,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {272227#true} call ULTIMATE.init(); {272236#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:58:54,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {272236#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {272227#true} is VALID [2022-04-08 08:58:54,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {272227#true} assume true; {272227#true} is VALID [2022-04-08 08:58:54,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {272227#true} {272227#true} #708#return; {272227#true} is VALID [2022-04-08 08:58:54,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {272227#true} call #t~ret161 := main(); {272227#true} is VALID [2022-04-08 08:58:54,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {272227#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {272227#true} is VALID [2022-04-08 08:58:54,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {272227#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,222 INFO L272 TraceCheckUtils]: 7: Hoare triple {272227#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {272227#true} is VALID [2022-04-08 08:58:54,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {272227#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;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;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {272227#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {272227#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {272227#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {272227#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {272227#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {272227#true} assume !false; {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {272227#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {272227#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {272227#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {272227#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {272227#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {272227#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {272227#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {272227#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {272227#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {272227#true} assume 8464 == #t~mem55;havoc #t~mem55; {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {272227#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {272227#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {272227#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {272227#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {272227#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {272227#true} ~skip~0 := 0; {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {272227#true} assume !false; {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {272227#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {272227#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {272227#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {272227#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {272227#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {272227#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {272227#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {272227#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {272227#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {272227#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {272227#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {272227#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {272227#true} assume 8496 == #t~mem58;havoc #t~mem58; {272227#true} is VALID [2022-04-08 08:58:54,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {272227#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {272227#true} is VALID [2022-04-08 08:58:54,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {272227#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {272227#true} is VALID [2022-04-08 08:58:54,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {272227#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {272227#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,230 INFO L290 TraceCheckUtils]: 55: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,231 INFO L290 TraceCheckUtils]: 59: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,240 INFO L290 TraceCheckUtils]: 83: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {272232#(not (= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {272233#(not (= |ssl3_accept_#t~mem77| 3))} is VALID [2022-04-08 08:58:54,240 INFO L290 TraceCheckUtils]: 85: Hoare triple {272233#(not (= |ssl3_accept_#t~mem77| 3))} assume 8656 == #t~mem77;havoc #t~mem77; {272227#true} is VALID [2022-04-08 08:58:54,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {272227#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {272227#true} is VALID [2022-04-08 08:58:54,240 INFO L290 TraceCheckUtils]: 87: Hoare triple {272227#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {272227#true} is VALID [2022-04-08 08:58:54,240 INFO L290 TraceCheckUtils]: 88: Hoare triple {272227#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {272227#true} is VALID [2022-04-08 08:58:54,240 INFO L290 TraceCheckUtils]: 89: Hoare triple {272227#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {272227#true} assume !(0 == ~tmp___10~0); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 91: Hoare triple {272227#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 92: Hoare triple {272227#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 93: Hoare triple {272227#true} ~skip~0 := 0; {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 94: Hoare triple {272227#true} assume !false; {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 95: Hoare triple {272227#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 96: Hoare triple {272227#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 97: Hoare triple {272227#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 98: Hoare triple {272227#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 99: Hoare triple {272227#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 100: Hoare triple {272227#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 101: Hoare triple {272227#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,241 INFO L290 TraceCheckUtils]: 102: Hoare triple {272227#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 103: Hoare triple {272227#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 104: Hoare triple {272227#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 105: Hoare triple {272227#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 106: Hoare triple {272227#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 107: Hoare triple {272227#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 108: Hoare triple {272227#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 109: Hoare triple {272227#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 110: Hoare triple {272227#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 111: Hoare triple {272227#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,242 INFO L290 TraceCheckUtils]: 112: Hoare triple {272227#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 113: Hoare triple {272227#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 114: Hoare triple {272227#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 115: Hoare triple {272227#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 116: Hoare triple {272227#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 117: Hoare triple {272227#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 118: Hoare triple {272227#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 119: Hoare triple {272227#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 120: Hoare triple {272227#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 121: Hoare triple {272227#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 122: Hoare triple {272227#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,243 INFO L290 TraceCheckUtils]: 123: Hoare triple {272227#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 124: Hoare triple {272227#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 125: Hoare triple {272227#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 126: Hoare triple {272227#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 127: Hoare triple {272227#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 128: Hoare triple {272227#true} assume 8672 == #t~mem79;havoc #t~mem79; {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 129: Hoare triple {272227#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 130: Hoare triple {272227#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 131: Hoare triple {272227#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 132: Hoare triple {272227#true} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {272227#true} is VALID [2022-04-08 08:58:54,244 INFO L290 TraceCheckUtils]: 133: Hoare triple {272227#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 134: Hoare triple {272227#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 135: Hoare triple {272227#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 136: Hoare triple {272227#true} ~skip~0 := 0; {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 137: Hoare triple {272227#true} assume !false; {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 138: Hoare triple {272227#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 139: Hoare triple {272227#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 140: Hoare triple {272227#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 141: Hoare triple {272227#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 142: Hoare triple {272227#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 143: Hoare triple {272227#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,245 INFO L290 TraceCheckUtils]: 144: Hoare triple {272227#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 145: Hoare triple {272227#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 146: Hoare triple {272227#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 147: Hoare triple {272227#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 148: Hoare triple {272227#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 149: Hoare triple {272227#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 150: Hoare triple {272227#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 151: Hoare triple {272227#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 152: Hoare triple {272227#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 153: Hoare triple {272227#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 154: Hoare triple {272227#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,246 INFO L290 TraceCheckUtils]: 155: Hoare triple {272227#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 156: Hoare triple {272227#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 157: Hoare triple {272227#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 158: Hoare triple {272227#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 159: Hoare triple {272227#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 160: Hoare triple {272227#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 161: Hoare triple {272227#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 162: Hoare triple {272227#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 163: Hoare triple {272227#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 164: Hoare triple {272227#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 165: Hoare triple {272227#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 166: Hoare triple {272227#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 167: Hoare triple {272227#true} assume 8640 == #t~mem75;havoc #t~mem75; {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 168: Hoare triple {272227#true} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 169: Hoare triple {272227#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {272227#true} is VALID [2022-04-08 08:58:54,247 INFO L290 TraceCheckUtils]: 170: Hoare triple {272227#true} assume !(~ret~0 <= 0);call #t~mem139 := read~int(~s.base, 92 + ~s.offset, 4); {272227#true} is VALID [2022-04-08 08:58:54,248 INFO L290 TraceCheckUtils]: 171: Hoare triple {272227#true} assume 0 != #t~mem139;havoc #t~mem139;call write~int(3, ~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,249 INFO L290 TraceCheckUtils]: 172: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,249 INFO L290 TraceCheckUtils]: 173: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,250 INFO L290 TraceCheckUtils]: 174: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,250 INFO L290 TraceCheckUtils]: 175: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,250 INFO L290 TraceCheckUtils]: 176: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,251 INFO L290 TraceCheckUtils]: 177: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,251 INFO L290 TraceCheckUtils]: 178: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,251 INFO L290 TraceCheckUtils]: 179: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,252 INFO L290 TraceCheckUtils]: 180: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,252 INFO L290 TraceCheckUtils]: 181: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,252 INFO L290 TraceCheckUtils]: 182: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,253 INFO L290 TraceCheckUtils]: 183: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,253 INFO L290 TraceCheckUtils]: 184: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,253 INFO L290 TraceCheckUtils]: 185: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,254 INFO L290 TraceCheckUtils]: 186: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,254 INFO L290 TraceCheckUtils]: 187: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,254 INFO L290 TraceCheckUtils]: 188: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,255 INFO L290 TraceCheckUtils]: 189: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,255 INFO L290 TraceCheckUtils]: 190: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,255 INFO L290 TraceCheckUtils]: 191: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,256 INFO L290 TraceCheckUtils]: 192: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,256 INFO L290 TraceCheckUtils]: 193: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,256 INFO L290 TraceCheckUtils]: 194: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,257 INFO L290 TraceCheckUtils]: 195: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,257 INFO L290 TraceCheckUtils]: 196: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,257 INFO L290 TraceCheckUtils]: 197: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,258 INFO L290 TraceCheckUtils]: 198: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,258 INFO L290 TraceCheckUtils]: 199: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,258 INFO L290 TraceCheckUtils]: 200: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,259 INFO L290 TraceCheckUtils]: 201: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,259 INFO L290 TraceCheckUtils]: 202: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,259 INFO L290 TraceCheckUtils]: 203: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,260 INFO L290 TraceCheckUtils]: 204: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,260 INFO L290 TraceCheckUtils]: 205: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,260 INFO L290 TraceCheckUtils]: 206: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:58:54,261 INFO L290 TraceCheckUtils]: 207: Hoare triple {272234#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {272235#(not (= |ssl3_accept_#t~mem77| 8656))} is VALID [2022-04-08 08:58:54,261 INFO L290 TraceCheckUtils]: 208: Hoare triple {272235#(not (= |ssl3_accept_#t~mem77| 8656))} assume 8656 == #t~mem77;havoc #t~mem77; {272228#false} is VALID [2022-04-08 08:58:54,261 INFO L290 TraceCheckUtils]: 209: Hoare triple {272228#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {272228#false} is VALID [2022-04-08 08:58:54,261 INFO L290 TraceCheckUtils]: 210: Hoare triple {272228#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {272228#false} is VALID [2022-04-08 08:58:54,261 INFO L290 TraceCheckUtils]: 211: Hoare triple {272228#false} assume !(2 == ~blastFlag~0); {272228#false} is VALID [2022-04-08 08:58:54,261 INFO L290 TraceCheckUtils]: 212: Hoare triple {272228#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {272228#false} is VALID [2022-04-08 08:58:54,261 INFO L290 TraceCheckUtils]: 213: Hoare triple {272228#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 214: Hoare triple {272228#false} assume !(0 == ~tmp___10~0); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 215: Hoare triple {272228#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 216: Hoare triple {272228#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 217: Hoare triple {272228#false} ~skip~0 := 0; {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 218: Hoare triple {272228#false} assume !false; {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 219: Hoare triple {272228#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 220: Hoare triple {272228#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 221: Hoare triple {272228#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 222: Hoare triple {272228#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 223: Hoare triple {272228#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 224: Hoare triple {272228#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 225: Hoare triple {272228#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 226: Hoare triple {272228#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,262 INFO L290 TraceCheckUtils]: 227: Hoare triple {272228#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 228: Hoare triple {272228#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 229: Hoare triple {272228#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 230: Hoare triple {272228#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 231: Hoare triple {272228#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 232: Hoare triple {272228#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 233: Hoare triple {272228#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 234: Hoare triple {272228#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 235: Hoare triple {272228#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 236: Hoare triple {272228#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 237: Hoare triple {272228#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 238: Hoare triple {272228#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 239: Hoare triple {272228#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 240: Hoare triple {272228#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,263 INFO L290 TraceCheckUtils]: 241: Hoare triple {272228#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 242: Hoare triple {272228#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 243: Hoare triple {272228#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 244: Hoare triple {272228#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 245: Hoare triple {272228#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 246: Hoare triple {272228#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 247: Hoare triple {272228#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 248: Hoare triple {272228#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 249: Hoare triple {272228#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 250: Hoare triple {272228#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 251: Hoare triple {272228#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 252: Hoare triple {272228#false} assume 8672 == #t~mem79;havoc #t~mem79; {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 253: Hoare triple {272228#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {272228#false} is VALID [2022-04-08 08:58:54,264 INFO L290 TraceCheckUtils]: 254: Hoare triple {272228#false} assume !(3 == ~blastFlag~0); {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 255: Hoare triple {272228#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 256: Hoare triple {272228#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 257: Hoare triple {272228#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 258: Hoare triple {272228#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 259: Hoare triple {272228#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 260: Hoare triple {272228#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 261: Hoare triple {272228#false} ~skip~0 := 0; {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 262: Hoare triple {272228#false} assume !false; {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 263: Hoare triple {272228#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,265 INFO L290 TraceCheckUtils]: 264: Hoare triple {272228#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 265: Hoare triple {272228#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 266: Hoare triple {272228#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 267: Hoare triple {272228#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 268: Hoare triple {272228#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 269: Hoare triple {272228#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 270: Hoare triple {272228#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 271: Hoare triple {272228#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 272: Hoare triple {272228#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 273: Hoare triple {272228#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,266 INFO L290 TraceCheckUtils]: 274: Hoare triple {272228#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 275: Hoare triple {272228#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 276: Hoare triple {272228#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 277: Hoare triple {272228#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 278: Hoare triple {272228#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 279: Hoare triple {272228#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 280: Hoare triple {272228#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 281: Hoare triple {272228#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 282: Hoare triple {272228#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 283: Hoare triple {272228#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 284: Hoare triple {272228#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,267 INFO L290 TraceCheckUtils]: 285: Hoare triple {272228#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 286: Hoare triple {272228#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 287: Hoare triple {272228#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 288: Hoare triple {272228#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 289: Hoare triple {272228#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 290: Hoare triple {272228#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 291: Hoare triple {272228#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 292: Hoare triple {272228#false} assume 8640 == #t~mem75;havoc #t~mem75; {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 293: Hoare triple {272228#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 294: Hoare triple {272228#false} assume !(4 == ~blastFlag~0); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 295: Hoare triple {272228#false} assume !(7 == ~blastFlag~0); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 296: Hoare triple {272228#false} assume !(10 == ~blastFlag~0); {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 297: Hoare triple {272228#false} assume 13 == ~blastFlag~0; {272228#false} is VALID [2022-04-08 08:58:54,268 INFO L290 TraceCheckUtils]: 298: Hoare triple {272228#false} assume !false; {272228#false} is VALID [2022-04-08 08:58:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 474 proven. 106 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-08 08:58:54,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:58:54,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833496713] [2022-04-08 08:58:54,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833496713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:58:54,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487194817] [2022-04-08 08:58:54,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:58:54,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:58:54,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:58:54,271 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-08 08:58:54,271 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-08 08:58:55,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 08:58:55,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:58:55,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 08:58:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:58:55,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:58:55,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-08 08:58:55,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-08 08:58:55,514 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-04-08 08:58:55,515 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 2 case distinctions, treesize of input 33 treesize of output 31 [2022-04-08 08:58:55,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 08:58:55,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 08:58:55,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 08:58:55,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-04-08 08:58:55,698 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:58:55,698 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-08 08:58:55,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 08:58:55,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-08 08:58:55,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-08 08:58:55,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7