/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:26:51,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:26:51,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:26:51,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:26:51,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:26:51,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:26:51,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:26:51,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:26:51,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:26:51,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:26:51,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:26:51,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:26:51,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:26:51,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:26:51,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:26:51,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:26:51,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:26:51,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:26:51,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:26:51,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:26:51,278 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:26:51,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:26:51,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:26:51,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:26:51,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:26:51,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:26:51,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:26:51,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:26:51,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:26:51,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:26:51,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:26:51,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:26:51,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:26:51,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:26:51,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:26:51,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:26:51,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:26:51,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:26:51,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:26:51,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:26:51,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:26:51,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:26:51,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:26:51,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:26:51,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:26:51,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:26:51,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:26:51,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:26:51,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:26:51,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:26:51,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:26:51,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:26:51,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:26:51,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:26:51,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:26:51,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:26:51,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:26:51,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:26:51,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:26:51,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:26:51,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:26:51,308 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:26:51,308 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:26:51,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:26:51,309 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:26:51,309 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 15:26:51,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:26:51,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:26:51,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:26:51,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:26:51,518 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:26:51,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c [2022-04-28 15:26:51,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2931bc79/99f82590010b4e03bdb8e194d1deb0a4/FLAG819c0358d [2022-04-28 15:26:52,025 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:26:52,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c [2022-04-28 15:26:52,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2931bc79/99f82590010b4e03bdb8e194d1deb0a4/FLAG819c0358d [2022-04-28 15:26:52,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2931bc79/99f82590010b4e03bdb8e194d1deb0a4 [2022-04-28 15:26:52,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:26:52,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:26:52,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:26:52,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:26:52,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:26:52,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351404b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52, skipping insertion in model container [2022-04-28 15:26:52,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:26:52,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:26:52,463 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.11.i.cil-1.c[74369,74382] [2022-04-28 15:26:52,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:26:52,491 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:26:52,620 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.11.i.cil-1.c[74369,74382] [2022-04-28 15:26:52,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:26:52,636 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:26:52,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52 WrapperNode [2022-04-28 15:26:52,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:26:52,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:26:52,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:26:52,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:26:52,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:26:52,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:26:52,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:26:52,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:26:52,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (1/1) ... [2022-04-28 15:26:52,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:26:52,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:26:52,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 15:26:52,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:26:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:26:52,830 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:26:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:26:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:26:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:26:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:26:52,831 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:26:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:26:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:26:53,011 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:26:53,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:26:53,543 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:26:54,081 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:26:54,082 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:26:54,091 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:26:54,100 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:26:54,100 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:26:54,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:26:54 BoogieIcfgContainer [2022-04-28 15:26:54,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:26:54,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:26:54,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:26:54,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:26:54,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:26:52" (1/3) ... [2022-04-28 15:26:54,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10128fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:26:54, skipping insertion in model container [2022-04-28 15:26:54,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:52" (2/3) ... [2022-04-28 15:26:54,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10128fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:26:54, skipping insertion in model container [2022-04-28 15:26:54,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:26:54" (3/3) ... [2022-04-28 15:26:54,108 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-04-28 15:26:54,121 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:26:54,121 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:26:54,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:26:54,180 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@778be165, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1efe334c [2022-04-28 15:26:54,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:26:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 15:26:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 15:26:54,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:54,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:54,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 1 times [2022-04-28 15:26:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:54,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2117706307] [2022-04-28 15:26:54,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:26:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 2 times [2022-04-28 15:26:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:54,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498818764] [2022-04-28 15:26:54,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:54,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:54,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(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(196, 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); {161#true} is VALID [2022-04-28 15:26:54,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:26:54,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-28 15:26:54,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(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-28 15:26:54,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(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(196, 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); {161#true} is VALID [2022-04-28 15:26:54,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:26:54,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-28 15:26:54,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-28 15:26:54,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-28 15:26:54,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {161#true} is VALID [2022-04-28 15:26:54,628 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-28 15:26:54,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:54,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-28 15:26:54,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-28 15:26:54,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {162#false} is VALID [2022-04-28 15:26:54,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {162#false} is VALID [2022-04-28 15:26:54,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-28 15:26:54,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {162#false} is VALID [2022-04-28 15:26:54,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-28 15:26:54,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {162#false} is VALID [2022-04-28 15:26:54,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 7 == ~blastFlag~0; {162#false} is VALID [2022-04-28 15:26:54,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 15:26:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:26:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:54,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498818764] [2022-04-28 15:26:54,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498818764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:54,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:54,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:54,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:54,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2117706307] [2022-04-28 15:26:54,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2117706307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:54,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:54,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409093566] [2022-04-28 15:26:54,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:54,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 15:26:54,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:54,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:54,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:54,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:54,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:54,737 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:57,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:02,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:06,317 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-28 15:27:06,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:06,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 15:27:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-28 15:27:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-28 15:27:06,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-28 15:27:06,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:06,847 INFO L225 Difference]: With dead ends: 430 [2022-04-28 15:27:06,847 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 15:27:06,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:06,851 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:06,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 15:27:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 15:27:06,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-28 15:27:06,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:06,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:06,893 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:06,894 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:06,908 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-28 15:27:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-28 15:27:06,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:06,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:06,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 15:27:06,918 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 15:27:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:06,927 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-28 15:27:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-28 15:27:06,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:06,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:06,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:06,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-28 15:27:06,937 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-28 15:27:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:06,937 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-28 15:27:06,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:06,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-28 15:27:07,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-28 15:27:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 15:27:07,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:07,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:07,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:27:07,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 1 times [2022-04-28 15:27:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:07,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129681408] [2022-04-28 15:27:07,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:27:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 2 times [2022-04-28 15:27:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:07,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468840684] [2022-04-28 15:27:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:07,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:07,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {1902#(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(196, 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); {1895#true} is VALID [2022-04-28 15:27:07,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 15:27:07,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #690#return; {1895#true} is VALID [2022-04-28 15:27:07,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1902#(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-28 15:27:07,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#(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(196, 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); {1895#true} is VALID [2022-04-28 15:27:07,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 15:27:07,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #690#return; {1895#true} is VALID [2022-04-28 15:27:07,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret161 := main(); {1895#true} is VALID [2022-04-28 15:27:07,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1895#true} is VALID [2022-04-28 15:27:07,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1895#true} is VALID [2022-04-28 15:27:07,330 INFO L272 TraceCheckUtils]: 7: Hoare triple {1895#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1895#true} is VALID [2022-04-28 15:27:07,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:07,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1901#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-28 15:27:07,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {1901#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1896#false} is VALID [2022-04-28 15:27:07,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {1896#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {1896#false} is VALID [2022-04-28 15:27:07,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {1896#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {1896#false} is VALID [2022-04-28 15:27:07,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {1896#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1896#false} is VALID [2022-04-28 15:27:07,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {1896#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {1896#false} is VALID [2022-04-28 15:27:07,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {1896#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1896#false} is VALID [2022-04-28 15:27:07,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {1896#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {1896#false} is VALID [2022-04-28 15:27:07,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {1896#false} assume 7 == ~blastFlag~0; {1896#false} is VALID [2022-04-28 15:27:07,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-28 15:27:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:07,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:07,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468840684] [2022-04-28 15:27:07,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468840684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:07,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:07,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:07,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:07,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129681408] [2022-04-28 15:27:07,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129681408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:07,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:07,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715134465] [2022-04-28 15:27:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:07,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 15:27:07,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:07,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:07,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:07,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:07,400 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:10,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:12,606 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-28 15:27:14,626 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-28 15:27:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:15,820 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-28 15:27:15,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:15,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 15:27:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:27:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:27:15,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-28 15:27:16,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:16,255 INFO L225 Difference]: With dead ends: 444 [2022-04-28 15:27:16,255 INFO L226 Difference]: Without dead ends: 289 [2022-04-28 15:27:16,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:16,257 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 64 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:16,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 474 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-04-28 15:27:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-28 15:27:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-28 15:27:16,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:16,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:16,274 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:16,275 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:16,281 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-28 15:27:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-28 15:27:16,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:16,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:16,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-28 15:27:16,282 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-28 15:27:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:16,289 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-28 15:27:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-28 15:27:16,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:16,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:16,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:16,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-28 15:27:16,294 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-28 15:27:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:16,295 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-28 15:27:16,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:16,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-28 15:27:16,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-28 15:27:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 15:27:16,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:16,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:16,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:27:16,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1913847322, now seen corresponding path program 1 times [2022-04-28 15:27:16,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:16,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334906949] [2022-04-28 15:27:16,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:27:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1913847322, now seen corresponding path program 2 times [2022-04-28 15:27:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:16,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869453082] [2022-04-28 15:27:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:16,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:16,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {3778#(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(196, 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); {3771#true} is VALID [2022-04-28 15:27:16,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 15:27:16,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3771#true} {3771#true} #690#return; {3771#true} is VALID [2022-04-28 15:27:16,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3778#(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-28 15:27:16,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {3778#(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(196, 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); {3771#true} is VALID [2022-04-28 15:27:16,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 15:27:16,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #690#return; {3771#true} is VALID [2022-04-28 15:27:16,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret161 := main(); {3771#true} is VALID [2022-04-28 15:27:16,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3771#true} is VALID [2022-04-28 15:27:16,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {3771#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3771#true} is VALID [2022-04-28 15:27:16,669 INFO L272 TraceCheckUtils]: 7: Hoare triple {3771#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3771#true} is VALID [2022-04-28 15:27:16,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {3771#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !false; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:27:16,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3777#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-28 15:27:16,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {3777#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {3772#false} is VALID [2022-04-28 15:27:16,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {3772#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3772#false} is VALID [2022-04-28 15:27:16,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {3772#false} assume !(4 == ~blastFlag~0); {3772#false} is VALID [2022-04-28 15:27:16,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {3772#false} assume 5 == ~blastFlag~0; {3772#false} is VALID [2022-04-28 15:27:16,709 INFO L290 TraceCheckUtils]: 48: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-28 15:27:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:16,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:16,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869453082] [2022-04-28 15:27:16,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869453082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:16,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:16,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:16,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:16,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334906949] [2022-04-28 15:27:16,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334906949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:16,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:16,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887258496] [2022-04-28 15:27:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:16,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 15:27:16,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:16,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:16,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:16,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:16,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:16,771 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:20,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:22,719 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-28 15:27:24,747 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-28 15:27:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:25,867 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-28 15:27:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 15:27:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:27:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:27:25,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-28 15:27:26,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:26,211 INFO L225 Difference]: With dead ends: 503 [2022-04-28 15:27:26,211 INFO L226 Difference]: Without dead ends: 319 [2022-04-28 15:27:26,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:26,218 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 123 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:26,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 344 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 478 Invalid, 3 Unknown, 0 Unchecked, 7.1s Time] [2022-04-28 15:27:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-28 15:27:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-28 15:27:26,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:26,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,253 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,254 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:26,270 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-28 15:27:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-28 15:27:26,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:26,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:26,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-28 15:27:26,271 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-28 15:27:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:26,277 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-28 15:27:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-28 15:27:26,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:26,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:26,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:26,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-28 15:27:26,282 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 49 [2022-04-28 15:27:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:26,283 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-28 15:27:26,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-28 15:27:26,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 15:27:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 15:27:26,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:26,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:26,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:27:26,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1017457862, now seen corresponding path program 1 times [2022-04-28 15:27:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:26,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430353905] [2022-04-28 15:27:26,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:27:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1017457862, now seen corresponding path program 2 times [2022-04-28 15:27:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:26,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940785985] [2022-04-28 15:27:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:26,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#(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(196, 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); {5905#true} is VALID [2022-04-28 15:27:26,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-28 15:27:26,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5905#true} {5905#true} #690#return; {5905#true} is VALID [2022-04-28 15:27:26,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {5905#true} call ULTIMATE.init(); {5912#(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-28 15:27:26,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#(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(196, 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); {5905#true} is VALID [2022-04-28 15:27:26,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-28 15:27:26,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5905#true} {5905#true} #690#return; {5905#true} is VALID [2022-04-28 15:27:26,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {5905#true} call #t~ret161 := main(); {5905#true} is VALID [2022-04-28 15:27:26,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {5905#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5905#true} is VALID [2022-04-28 15:27:26,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {5905#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5905#true} is VALID [2022-04-28 15:27:26,726 INFO L272 TraceCheckUtils]: 7: Hoare triple {5905#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5905#true} is VALID [2022-04-28 15:27:26,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {5905#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5911#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 15:27:26,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {5911#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {5906#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {5906#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {5906#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {5906#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {5906#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {5906#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {5906#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {5906#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {5906#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {5906#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {5906#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {5906#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {5906#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {5906#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {5906#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {5906#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {5906#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {5906#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {5906#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {5906#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {5906#false} assume 8641 == #t~mem76;havoc #t~mem76; {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {5906#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5906#false} is VALID [2022-04-28 15:27:26,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {5906#false} assume !(4 == ~blastFlag~0); {5906#false} is VALID [2022-04-28 15:27:26,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {5906#false} assume 5 == ~blastFlag~0; {5906#false} is VALID [2022-04-28 15:27:26,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-04-28 15:27:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:26,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:26,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940785985] [2022-04-28 15:27:26,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940785985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:26,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:26,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:26,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:26,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430353905] [2022-04-28 15:27:26,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430353905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:26,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:26,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:26,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111838719] [2022-04-28 15:27:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:26,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 15:27:26,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:26,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:26,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:26,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:26,779 INFO L87 Difference]: Start difference. First operand 239 states and 388 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:30,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:34,423 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-28 15:27:38,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:39,383 INFO L93 Difference]: Finished difference Result 491 states and 798 transitions. [2022-04-28 15:27:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 15:27:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:27:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:27:39,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-28 15:27:39,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:39,710 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:27:39,710 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:27:39,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:39,712 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:39,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:27:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:27:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:27:39,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:39,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,721 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,722 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:39,726 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:27:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:27:39,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:39,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:39,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 15:27:39,727 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 15:27:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:39,731 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:27:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:27:39,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:39,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:39,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:39,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2022-04-28 15:27:39,736 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 50 [2022-04-28 15:27:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:39,736 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2022-04-28 15:27:39,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 407 transitions. [2022-04-28 15:27:40,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2022-04-28 15:27:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:27:40,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:40,022 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:27:40,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:27:40,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash 516188517, now seen corresponding path program 1 times [2022-04-28 15:27:40,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:40,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806440148] [2022-04-28 15:27:40,040 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:27:40,041 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 516188517, now seen corresponding path program 2 times [2022-04-28 15:27:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:40,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414273773] [2022-04-28 15:27:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:40,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:40,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {7940#(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(196, 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); {7933#true} is VALID [2022-04-28 15:27:40,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-28 15:27:40,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7933#true} {7933#true} #690#return; {7933#true} is VALID [2022-04-28 15:27:40,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7940#(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-28 15:27:40,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {7940#(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(196, 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); {7933#true} is VALID [2022-04-28 15:27:40,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-28 15:27:40,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #690#return; {7933#true} is VALID [2022-04-28 15:27:40,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret161 := main(); {7933#true} is VALID [2022-04-28 15:27:40,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {7933#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7933#true} is VALID [2022-04-28 15:27:40,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {7933#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7933#true} is VALID [2022-04-28 15:27:40,217 INFO L272 TraceCheckUtils]: 7: Hoare triple {7933#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7933#true} is VALID [2022-04-28 15:27:40,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {7933#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:40,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7939#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-28 15:27:40,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {7939#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7934#false} is VALID [2022-04-28 15:27:40,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {7934#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {7934#false} is VALID [2022-04-28 15:27:40,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {7934#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {7934#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {7934#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7934#false} is VALID [2022-04-28 15:27:40,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#false} ~skip~0 := 0; {7934#false} is VALID [2022-04-28 15:27:40,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-28 15:27:40,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {7934#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {7934#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {7934#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {7934#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {7934#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {7934#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {7934#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {7934#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {7934#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {7934#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {7934#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {7934#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {7934#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {7934#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {7934#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {7934#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {7934#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {7934#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {7934#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {7934#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {7934#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {7934#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {7934#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {7934#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {7934#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {7934#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {7934#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {7934#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {7934#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {7934#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {7934#false} assume 8641 == #t~mem76;havoc #t~mem76; {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {7934#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {7934#false} assume !(4 == ~blastFlag~0); {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {7934#false} assume 5 == ~blastFlag~0; {7934#false} is VALID [2022-04-28 15:27:40,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-28 15:27:40,239 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-28 15:27:40,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:40,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414273773] [2022-04-28 15:27:40,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414273773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:40,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:40,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:40,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:40,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806440148] [2022-04-28 15:27:40,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806440148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:40,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:40,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192987887] [2022-04-28 15:27:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:40,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:40,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:40,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:40,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:40,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:40,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:40,292 INFO L87 Difference]: Start difference. First operand 250 states and 407 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:43,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:45,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:49,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:51,849 INFO L93 Difference]: Finished difference Result 491 states and 797 transitions. [2022-04-28 15:27:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:27:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:27:51,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:27:52,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:52,155 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:27:52,155 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:27:52,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:52,156 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:52,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 363 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-28 15:27:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:27:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:27:52,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:52,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:52,164 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:52,164 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:52,168 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:27:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:27:52,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:52,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:52,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 15:27:52,170 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 15:27:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:52,174 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:27:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:27:52,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:52,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:52,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:52,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 406 transitions. [2022-04-28 15:27:52,178 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 406 transitions. Word has length 63 [2022-04-28 15:27:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:52,179 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 406 transitions. [2022-04-28 15:27:52,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:52,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 406 transitions. [2022-04-28 15:27:52,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 406 transitions. [2022-04-28 15:27:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:27:52,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:52,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:52,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:27:52,470 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:52,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1956023147, now seen corresponding path program 1 times [2022-04-28 15:27:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:52,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363336798] [2022-04-28 15:27:52,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:27:52,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1956023147, now seen corresponding path program 2 times [2022-04-28 15:27:52,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:52,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028317653] [2022-04-28 15:27:52,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:52,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:52,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {9968#(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(196, 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); {9961#true} is VALID [2022-04-28 15:27:52,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-28 15:27:52,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9961#true} {9961#true} #690#return; {9961#true} is VALID [2022-04-28 15:27:52,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {9961#true} call ULTIMATE.init(); {9968#(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-28 15:27:52,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {9968#(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(196, 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); {9961#true} is VALID [2022-04-28 15:27:52,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-28 15:27:52,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9961#true} {9961#true} #690#return; {9961#true} is VALID [2022-04-28 15:27:52,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {9961#true} call #t~ret161 := main(); {9961#true} is VALID [2022-04-28 15:27:52,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {9961#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9961#true} is VALID [2022-04-28 15:27:52,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {9961#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9961#true} is VALID [2022-04-28 15:27:52,611 INFO L272 TraceCheckUtils]: 7: Hoare triple {9961#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9961#true} is VALID [2022-04-28 15:27:52,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {9961#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:52,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:52,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:52,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:52,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:52,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:52,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:52,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9967#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-28 15:27:52,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {9967#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {9962#false} is VALID [2022-04-28 15:27:52,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {9962#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {9962#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {9962#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {9962#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {9962#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, 80 + ~s.offset, 8); {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {9962#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {9962#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {9962#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {9962#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {9962#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {9962#false} ~skip~0 := 0; {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {9962#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {9962#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {9962#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {9962#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {9962#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {9962#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {9962#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {9962#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {9962#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {9962#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {9962#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {9962#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {9962#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {9962#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {9962#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {9962#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {9962#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {9962#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {9962#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {9962#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {9962#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {9962#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {9962#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {9962#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {9962#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {9962#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {9962#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {9962#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {9962#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {9962#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:52,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {9962#false} assume 8641 == #t~mem76;havoc #t~mem76; {9962#false} is VALID [2022-04-28 15:27:52,621 INFO L290 TraceCheckUtils]: 60: Hoare triple {9962#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9962#false} is VALID [2022-04-28 15:27:52,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {9962#false} assume !(4 == ~blastFlag~0); {9962#false} is VALID [2022-04-28 15:27:52,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {9962#false} assume 5 == ~blastFlag~0; {9962#false} is VALID [2022-04-28 15:27:52,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-28 15:27:52,622 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-28 15:27:52,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:52,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028317653] [2022-04-28 15:27:52,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028317653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:52,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:52,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:52,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:52,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363336798] [2022-04-28 15:27:52,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363336798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:52,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:52,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082927196] [2022-04-28 15:27:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:52,624 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-28 15:27:52,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:52,624 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-28 15:27:52,667 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-28 15:27:52,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:52,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:52,669 INFO L87 Difference]: Start difference. First operand 250 states and 406 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-28 15:27:58,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:01,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:02,117 INFO L93 Difference]: Finished difference Result 563 states and 907 transitions. [2022-04-28 15:28:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:02,118 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-28 15:28:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:02,118 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-28 15:28:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 15:28:02,121 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-28 15:28:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 15:28:02,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-28 15:28:02,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:02,524 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:28:02,524 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:28:02,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:02,525 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 151 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:02,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 15:28:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:28:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:28:02,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:02,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:02,534 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:02,535 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:02,540 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-28 15:28:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-28 15:28:02,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:02,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:02,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:02,541 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:02,546 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-28 15:28:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-28 15:28:02,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:02,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:02,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:02,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 402 transitions. [2022-04-28 15:28:02,551 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 402 transitions. Word has length 64 [2022-04-28 15:28:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:02,551 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 402 transitions. [2022-04-28 15:28:02,551 INFO L496 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-28 15:28:02,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 402 transitions. [2022-04-28 15:28:02,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 402 transitions. [2022-04-28 15:28:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:28:02,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:02,831 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:28:02,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:28:02,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash -69119703, now seen corresponding path program 1 times [2022-04-28 15:28:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:02,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619686955] [2022-04-28 15:28:02,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:28:02,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -69119703, now seen corresponding path program 2 times [2022-04-28 15:28:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:02,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815220457] [2022-04-28 15:28:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:02,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {12284#(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(196, 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); {12277#true} is VALID [2022-04-28 15:28:02,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-28 15:28:02,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12277#true} {12277#true} #690#return; {12277#true} is VALID [2022-04-28 15:28:02,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {12277#true} call ULTIMATE.init(); {12284#(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-28 15:28:02,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {12284#(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(196, 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); {12277#true} is VALID [2022-04-28 15:28:02,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-28 15:28:02,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12277#true} {12277#true} #690#return; {12277#true} is VALID [2022-04-28 15:28:02,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {12277#true} call #t~ret161 := main(); {12277#true} is VALID [2022-04-28 15:28:02,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {12277#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12277#true} is VALID [2022-04-28 15:28:02,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {12277#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12277#true} is VALID [2022-04-28 15:28:02,969 INFO L272 TraceCheckUtils]: 7: Hoare triple {12277#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12277#true} is VALID [2022-04-28 15:28:02,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {12277#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:28:02,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:28:02,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:28:02,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:28:02,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:28:02,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:28:02,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:28:02,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:28:02,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12283#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-28 15:28:02,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {12283#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {12278#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {12278#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {12278#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {12278#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, 80 + ~s.offset, 8); {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {12278#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {12278#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {12278#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {12278#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {12278#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {12278#false} ~skip~0 := 0; {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-28 15:28:02,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {12278#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {12278#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {12278#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {12278#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {12278#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {12278#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {12278#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {12278#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {12278#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {12278#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {12278#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {12278#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {12278#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {12278#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {12278#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {12278#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {12278#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {12278#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {12278#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {12278#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {12278#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {12278#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {12278#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {12278#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {12278#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {12278#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {12278#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {12278#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {12278#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {12278#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {12278#false} assume 8641 == #t~mem76;havoc #t~mem76; {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {12278#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {12278#false} assume !(4 == ~blastFlag~0); {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 62: Hoare triple {12278#false} assume 5 == ~blastFlag~0; {12278#false} is VALID [2022-04-28 15:28:02,978 INFO L290 TraceCheckUtils]: 63: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-28 15:28:02,979 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-28 15:28:02,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:02,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815220457] [2022-04-28 15:28:02,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815220457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:02,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:02,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:02,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:02,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619686955] [2022-04-28 15:28:02,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619686955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:02,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:02,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194606240] [2022-04-28 15:28:02,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:02,980 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-28 15:28:02,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:02,980 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-28 15:28:03,019 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-28 15:28:03,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:03,020 INFO L87 Difference]: Start difference. First operand 250 states and 402 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-28 15:28:05,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:06,164 INFO L93 Difference]: Finished difference Result 563 states and 900 transitions. [2022-04-28 15:28:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:06,164 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-28 15:28:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:06,164 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-28 15:28:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 15:28:06,168 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-28 15:28:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 15:28:06,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-28 15:28:06,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:06,602 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:28:06,602 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:28:06,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:06,603 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:06,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:28:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:28:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:28:06,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:06,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:06,612 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:06,613 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:06,619 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-28 15:28:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-28 15:28:06,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:06,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:06,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:06,621 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:06,627 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-28 15:28:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-28 15:28:06,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:06,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:06,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:06,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2022-04-28 15:28:06,631 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 64 [2022-04-28 15:28:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:06,632 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2022-04-28 15:28:06,632 INFO L496 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-28 15:28:06,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 398 transitions. [2022-04-28 15:28:06,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2022-04-28 15:28:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:28:06,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:06,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:28:06,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:28:06,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1045887136, now seen corresponding path program 1 times [2022-04-28 15:28:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:06,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806713882] [2022-04-28 15:28:06,860 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:28:06,860 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1045887136, now seen corresponding path program 2 times [2022-04-28 15:28:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:06,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621633470] [2022-04-28 15:28:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:06,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:06,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {14600#(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(196, 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); {14593#true} is VALID [2022-04-28 15:28:06,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-28 15:28:06,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14593#true} {14593#true} #690#return; {14593#true} is VALID [2022-04-28 15:28:06,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {14593#true} call ULTIMATE.init(); {14600#(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-28 15:28:06,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {14600#(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(196, 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); {14593#true} is VALID [2022-04-28 15:28:06,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-28 15:28:06,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14593#true} {14593#true} #690#return; {14593#true} is VALID [2022-04-28 15:28:06,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {14593#true} call #t~ret161 := main(); {14593#true} is VALID [2022-04-28 15:28:06,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {14593#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14593#true} is VALID [2022-04-28 15:28:06,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {14593#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14593#true} is VALID [2022-04-28 15:28:06,998 INFO L272 TraceCheckUtils]: 7: Hoare triple {14593#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14593#true} is VALID [2022-04-28 15:28:07,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {14593#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:07,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14599#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-28 15:28:07,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {14599#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {14594#false} is VALID [2022-04-28 15:28:07,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {14594#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {14594#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {14594#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {14594#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {14594#false} ~skip~0 := 0; {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {14594#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {14594#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {14594#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {14594#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {14594#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {14594#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {14594#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {14594#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {14594#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {14594#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {14594#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {14594#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {14594#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {14594#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {14594#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {14594#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {14594#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {14594#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {14594#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {14594#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {14594#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {14594#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 51: Hoare triple {14594#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {14594#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {14594#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {14594#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 55: Hoare triple {14594#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {14594#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {14594#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {14594#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {14594#false} assume 8641 == #t~mem76;havoc #t~mem76; {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {14594#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14594#false} is VALID [2022-04-28 15:28:07,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {14594#false} assume !(4 == ~blastFlag~0); {14594#false} is VALID [2022-04-28 15:28:07,010 INFO L290 TraceCheckUtils]: 62: Hoare triple {14594#false} assume 5 == ~blastFlag~0; {14594#false} is VALID [2022-04-28 15:28:07,010 INFO L290 TraceCheckUtils]: 63: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-28 15:28:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:28:07,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:07,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621633470] [2022-04-28 15:28:07,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621633470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:07,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:07,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:07,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:07,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806713882] [2022-04-28 15:28:07,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806713882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:07,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:07,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814693884] [2022-04-28 15:28:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:07,012 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-28 15:28:07,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:07,012 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-28 15:28:07,050 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-28 15:28:07,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:07,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:07,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:07,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:07,051 INFO L87 Difference]: Start difference. First operand 250 states and 398 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-28 15:28:09,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:09,937 INFO L93 Difference]: Finished difference Result 488 states and 779 transitions. [2022-04-28 15:28:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:09,937 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-28 15:28:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:09,938 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-28 15:28:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:28:09,940 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-28 15:28:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:28:09,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-28 15:28:10,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:10,244 INFO L225 Difference]: With dead ends: 488 [2022-04-28 15:28:10,244 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 15:28:10,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:10,245 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:10,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:28:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 15:28:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2022-04-28 15:28:10,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:10,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:10,259 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:10,260 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:10,263 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:28:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:28:10,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:10,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:10,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-28 15:28:10,265 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-28 15:28:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:10,268 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:28:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:28:10,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:10,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:10,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:10,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 397 transitions. [2022-04-28 15:28:10,272 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 397 transitions. Word has length 64 [2022-04-28 15:28:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:10,273 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 397 transitions. [2022-04-28 15:28:10,273 INFO L496 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-28 15:28:10,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 397 transitions. [2022-04-28 15:28:10,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 397 transitions. [2022-04-28 15:28:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:28:10,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:10,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:28:10,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:28:10,501 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1113447137, now seen corresponding path program 1 times [2022-04-28 15:28:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:10,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1321041740] [2022-04-28 15:28:10,508 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:28:10,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1113447137, now seen corresponding path program 2 times [2022-04-28 15:28:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:10,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868687830] [2022-04-28 15:28:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:10,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {16616#(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(196, 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); {16609#true} is VALID [2022-04-28 15:28:10,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-28 15:28:10,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16609#true} {16609#true} #690#return; {16609#true} is VALID [2022-04-28 15:28:10,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {16609#true} call ULTIMATE.init(); {16616#(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-28 15:28:10,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {16616#(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(196, 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); {16609#true} is VALID [2022-04-28 15:28:10,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-28 15:28:10,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16609#true} {16609#true} #690#return; {16609#true} is VALID [2022-04-28 15:28:10,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {16609#true} call #t~ret161 := main(); {16609#true} is VALID [2022-04-28 15:28:10,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {16609#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16609#true} is VALID [2022-04-28 15:28:10,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {16609#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16609#true} is VALID [2022-04-28 15:28:10,623 INFO L272 TraceCheckUtils]: 7: Hoare triple {16609#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16609#true} is VALID [2022-04-28 15:28:10,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {16609#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:10,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16615#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-28 15:28:10,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {16615#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {16610#false} is VALID [2022-04-28 15:28:10,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {16610#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {16610#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {16610#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16610#false} is VALID [2022-04-28 15:28:10,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {16610#false} ~skip~0 := 0; {16610#false} is VALID [2022-04-28 15:28:10,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-28 15:28:10,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {16610#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {16610#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {16610#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {16610#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {16610#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {16610#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {16610#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {16610#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {16610#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {16610#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {16610#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {16610#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {16610#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {16610#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {16610#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {16610#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {16610#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {16610#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {16610#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {16610#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 49: Hoare triple {16610#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 50: Hoare triple {16610#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {16610#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 52: Hoare triple {16610#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 53: Hoare triple {16610#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {16610#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {16610#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {16610#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {16610#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {16610#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {16610#false} assume 8641 == #t~mem76;havoc #t~mem76; {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {16610#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {16610#false} assume !(4 == ~blastFlag~0); {16610#false} is VALID [2022-04-28 15:28:10,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {16610#false} assume 5 == ~blastFlag~0; {16610#false} is VALID [2022-04-28 15:28:10,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-28 15:28:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:28:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:10,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868687830] [2022-04-28 15:28:10,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868687830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:10,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:10,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:10,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:10,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1321041740] [2022-04-28 15:28:10,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1321041740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:10,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:10,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:10,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926299810] [2022-04-28 15:28:10,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:10,638 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-28 15:28:10,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:10,638 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-28 15:28:10,681 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-28 15:28:10,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:10,682 INFO L87 Difference]: Start difference. First operand 250 states and 397 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-28 15:28:12,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:13,549 INFO L93 Difference]: Finished difference Result 487 states and 777 transitions. [2022-04-28 15:28:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:13,550 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-28 15:28:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:13,551 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-28 15:28:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:28:13,554 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-28 15:28:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:28:13,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-28 15:28:13,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:13,842 INFO L225 Difference]: With dead ends: 487 [2022-04-28 15:28:13,842 INFO L226 Difference]: Without dead ends: 263 [2022-04-28 15:28:13,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:13,843 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:13,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 491 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:28:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-28 15:28:13,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 250. [2022-04-28 15:28:13,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:13,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:13,850 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:13,851 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:13,854 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:28:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:28:13,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:13,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:13,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-28 15:28:13,855 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-28 15:28:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:13,858 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:28:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:28:13,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:13,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:13,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:13,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 396 transitions. [2022-04-28 15:28:13,863 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 396 transitions. Word has length 64 [2022-04-28 15:28:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:13,863 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 396 transitions. [2022-04-28 15:28:13,863 INFO L496 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-28 15:28:13,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 396 transitions. [2022-04-28 15:28:14,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 396 transitions. [2022-04-28 15:28:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:28:14,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:14,148 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:28:14,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:28:14,148 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash -515776498, now seen corresponding path program 1 times [2022-04-28 15:28:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:14,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1437970580] [2022-04-28 15:28:14,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:28:14,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash -515776498, now seen corresponding path program 2 times [2022-04-28 15:28:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:14,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251226594] [2022-04-28 15:28:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:14,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:14,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {18628#(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(196, 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); {18621#true} is VALID [2022-04-28 15:28:14,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-28 15:28:14,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18621#true} {18621#true} #690#return; {18621#true} is VALID [2022-04-28 15:28:14,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {18621#true} call ULTIMATE.init(); {18628#(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-28 15:28:14,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {18628#(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(196, 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); {18621#true} is VALID [2022-04-28 15:28:14,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-28 15:28:14,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18621#true} {18621#true} #690#return; {18621#true} is VALID [2022-04-28 15:28:14,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {18621#true} call #t~ret161 := main(); {18621#true} is VALID [2022-04-28 15:28:14,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {18621#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18621#true} is VALID [2022-04-28 15:28:14,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {18621#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {18621#true} is VALID [2022-04-28 15:28:14,266 INFO L272 TraceCheckUtils]: 7: Hoare triple {18621#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18621#true} is VALID [2022-04-28 15:28:14,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {18621#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:14,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18627#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {18627#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {18622#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {18622#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {18622#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {18622#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, 80 + ~s.offset, 8); {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {18622#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {18622#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {18622#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {18622#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {18622#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18622#false} is VALID [2022-04-28 15:28:14,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {18622#false} ~skip~0 := 0; {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {18622#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {18622#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {18622#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {18622#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {18622#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {18622#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {18622#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {18622#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {18622#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {18622#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {18622#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {18622#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {18622#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {18622#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {18622#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {18622#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {18622#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {18622#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {18622#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {18622#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {18622#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {18622#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {18622#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {18622#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {18622#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {18622#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {18622#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {18622#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {18622#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {18622#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {18622#false} assume 8641 == #t~mem76;havoc #t~mem76; {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {18622#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {18622#false} assume !(4 == ~blastFlag~0); {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {18622#false} assume 5 == ~blastFlag~0; {18622#false} is VALID [2022-04-28 15:28:14,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-28 15:28:14,276 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-28 15:28:14,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:14,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251226594] [2022-04-28 15:28:14,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251226594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:14,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:14,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:14,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:14,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1437970580] [2022-04-28 15:28:14,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1437970580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:14,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:14,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067822020] [2022-04-28 15:28:14,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:14,277 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-28 15:28:14,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:14,277 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-28 15:28:14,322 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-28 15:28:14,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:14,323 INFO L87 Difference]: Start difference. First operand 250 states and 396 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-28 15:28:18,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:21,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:23,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:24,952 INFO L93 Difference]: Finished difference Result 563 states and 891 transitions. [2022-04-28 15:28:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:24,952 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-28 15:28:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:24,953 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-28 15:28:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:28:24,955 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-28 15:28:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:28:24,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 15:28:25,349 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-28 15:28:25,354 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:28:25,354 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:28:25,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:25,356 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:25,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 15:28:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:28:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:28:25,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:25,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,370 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,370 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:25,394 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-28 15:28:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-28 15:28:25,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:25,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:25,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:25,395 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:25,400 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-28 15:28:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-28 15:28:25,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:25,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:25,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:25,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2022-04-28 15:28:25,414 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 65 [2022-04-28 15:28:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:25,415 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2022-04-28 15:28:25,415 INFO L496 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-28 15:28:25,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 392 transitions. [2022-04-28 15:28:25,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2022-04-28 15:28:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:28:25,659 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:25,659 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:28:25,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:28:25,659 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:25,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash -212472562, now seen corresponding path program 1 times [2022-04-28 15:28:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:25,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143393327] [2022-04-28 15:28:25,677 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:28:25,677 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash -212472562, now seen corresponding path program 2 times [2022-04-28 15:28:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:25,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965562074] [2022-04-28 15:28:25,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:25,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:25,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {20944#(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(196, 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); {20937#true} is VALID [2022-04-28 15:28:25,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-28 15:28:25,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20937#true} {20937#true} #690#return; {20937#true} is VALID [2022-04-28 15:28:25,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {20937#true} call ULTIMATE.init(); {20944#(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-28 15:28:25,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {20944#(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(196, 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); {20937#true} is VALID [2022-04-28 15:28:25,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-28 15:28:25,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20937#true} {20937#true} #690#return; {20937#true} is VALID [2022-04-28 15:28:25,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {20937#true} call #t~ret161 := main(); {20937#true} is VALID [2022-04-28 15:28:25,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {20937#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20937#true} is VALID [2022-04-28 15:28:25,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {20937#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {20937#true} is VALID [2022-04-28 15:28:25,797 INFO L272 TraceCheckUtils]: 7: Hoare triple {20937#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20937#true} is VALID [2022-04-28 15:28:25,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {20937#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:25,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20943#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-28 15:28:25,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {20943#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {20938#false} is VALID [2022-04-28 15:28:25,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {20938#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {20938#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20938#false} is VALID [2022-04-28 15:28:25,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {20938#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {20938#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, 80 + ~s.offset, 8); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {20938#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {20938#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {20938#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {20938#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {20938#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {20938#false} ~skip~0 := 0; {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {20938#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {20938#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {20938#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {20938#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {20938#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {20938#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {20938#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {20938#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {20938#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {20938#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {20938#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {20938#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {20938#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {20938#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {20938#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {20938#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {20938#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {20938#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {20938#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {20938#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {20938#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {20938#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {20938#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {20938#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 55: Hoare triple {20938#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {20938#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {20938#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {20938#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 59: Hoare triple {20938#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 60: Hoare triple {20938#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 61: Hoare triple {20938#false} assume 8641 == #t~mem76;havoc #t~mem76; {20938#false} is VALID [2022-04-28 15:28:25,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {20938#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20938#false} is VALID [2022-04-28 15:28:25,807 INFO L290 TraceCheckUtils]: 63: Hoare triple {20938#false} assume !(4 == ~blastFlag~0); {20938#false} is VALID [2022-04-28 15:28:25,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {20938#false} assume 5 == ~blastFlag~0; {20938#false} is VALID [2022-04-28 15:28:25,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-28 15:28:25,807 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-28 15:28:25,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:25,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965562074] [2022-04-28 15:28:25,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965562074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:25,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:25,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:25,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:25,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143393327] [2022-04-28 15:28:25,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143393327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:25,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:25,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126955144] [2022-04-28 15:28:25,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:25,808 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-28 15:28:25,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:25,809 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-28 15:28:25,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:25,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:25,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:25,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:25,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:25,850 INFO L87 Difference]: Start difference. First operand 250 states and 392 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-28 15:28:28,947 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-28 15:28:33,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:35,257 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-28 15:28:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:36,380 INFO L93 Difference]: Finished difference Result 563 states and 884 transitions. [2022-04-28 15:28:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:36,380 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-28 15:28:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:36,380 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-28 15:28:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 15:28:36,382 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-28 15:28:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 15:28:36,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-28 15:28:36,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:36,781 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:28:36,781 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:28:36,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:36,783 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 145 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:36,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 474 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-04-28 15:28:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:28:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:28:36,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:36,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:36,807 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:36,807 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:36,818 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-28 15:28:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-28 15:28:36,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:36,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:36,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:36,820 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:36,835 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-28 15:28:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-28 15:28:36,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:36,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:36,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:36,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2022-04-28 15:28:36,841 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 66 [2022-04-28 15:28:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:36,841 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2022-04-28 15:28:36,841 INFO L496 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-28 15:28:36,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 388 transitions. [2022-04-28 15:28:37,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2022-04-28 15:28:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:28:37,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:37,196 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:28:37,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:28:37,197 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:37,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1864777555, now seen corresponding path program 1 times [2022-04-28 15:28:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:37,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1530382193] [2022-04-28 15:28:37,215 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:28:37,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1864777555, now seen corresponding path program 2 times [2022-04-28 15:28:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:37,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903011376] [2022-04-28 15:28:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:37,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {23260#(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(196, 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); {23253#true} is VALID [2022-04-28 15:28:37,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-28 15:28:37,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23253#true} {23253#true} #690#return; {23253#true} is VALID [2022-04-28 15:28:37,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {23253#true} call ULTIMATE.init(); {23260#(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-28 15:28:37,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {23260#(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(196, 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); {23253#true} is VALID [2022-04-28 15:28:37,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-28 15:28:37,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23253#true} {23253#true} #690#return; {23253#true} is VALID [2022-04-28 15:28:37,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {23253#true} call #t~ret161 := main(); {23253#true} is VALID [2022-04-28 15:28:37,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {23253#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23253#true} is VALID [2022-04-28 15:28:37,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {23253#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23253#true} is VALID [2022-04-28 15:28:37,339 INFO L272 TraceCheckUtils]: 7: Hoare triple {23253#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23253#true} is VALID [2022-04-28 15:28:37,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {23253#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:37,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23259#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-28 15:28:37,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {23259#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {23254#false} is VALID [2022-04-28 15:28:37,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {23254#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {23254#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {23254#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {23254#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, 80 + ~s.offset, 8); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {23254#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {23254#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {23254#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {23254#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {23254#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {23254#false} ~skip~0 := 0; {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {23254#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {23254#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {23254#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {23254#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {23254#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {23254#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {23254#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {23254#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {23254#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {23254#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {23254#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {23254#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {23254#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {23254#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {23254#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {23254#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {23254#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 49: Hoare triple {23254#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {23254#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {23254#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {23254#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {23254#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {23254#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {23254#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {23254#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 57: Hoare triple {23254#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 58: Hoare triple {23254#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 59: Hoare triple {23254#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 60: Hoare triple {23254#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {23254#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:37,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#false} assume 8641 == #t~mem76;havoc #t~mem76; {23254#false} is VALID [2022-04-28 15:28:37,349 INFO L290 TraceCheckUtils]: 63: Hoare triple {23254#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23254#false} is VALID [2022-04-28 15:28:37,349 INFO L290 TraceCheckUtils]: 64: Hoare triple {23254#false} assume !(4 == ~blastFlag~0); {23254#false} is VALID [2022-04-28 15:28:37,349 INFO L290 TraceCheckUtils]: 65: Hoare triple {23254#false} assume 5 == ~blastFlag~0; {23254#false} is VALID [2022-04-28 15:28:37,349 INFO L290 TraceCheckUtils]: 66: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-28 15:28:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:28:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:37,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903011376] [2022-04-28 15:28:37,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903011376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:37,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:37,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:37,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:37,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1530382193] [2022-04-28 15:28:37,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1530382193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:37,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:37,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:37,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181824927] [2022-04-28 15:28:37,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:37,350 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-28 15:28:37,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:37,351 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-28 15:28:37,404 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-28 15:28:37,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:37,406 INFO L87 Difference]: Start difference. First operand 250 states and 388 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-28 15:28:39,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:40,151 INFO L93 Difference]: Finished difference Result 477 states and 749 transitions. [2022-04-28 15:28:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:40,151 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-28 15:28:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:40,152 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-28 15:28:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:28:40,153 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-28 15:28:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:28:40,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-28 15:28:40,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:40,323 INFO L225 Difference]: With dead ends: 477 [2022-04-28 15:28:40,323 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 15:28:40,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:40,324 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:40,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:28:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 15:28:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2022-04-28 15:28:40,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:40,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:40,332 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:40,332 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:40,335 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:28:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:28:40,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:40,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:40,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-28 15:28:40,336 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-28 15:28:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:40,339 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:28:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:28:40,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:40,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:40,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:40,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2022-04-28 15:28:40,343 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 67 [2022-04-28 15:28:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:40,343 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2022-04-28 15:28:40,343 INFO L496 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-28 15:28:40,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 387 transitions. [2022-04-28 15:28:40,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2022-04-28 15:28:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:28:40,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:40,547 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:28:40,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:28:40,547 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:40,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:40,548 INFO L85 PathProgramCache]: Analyzing trace with hash 804207484, now seen corresponding path program 1 times [2022-04-28 15:28:40,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:40,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [212003666] [2022-04-28 15:28:40,583 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:28:40,583 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash 804207484, now seen corresponding path program 2 times [2022-04-28 15:28:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:40,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975743031] [2022-04-28 15:28:40,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:40,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {25232#(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(196, 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); {25225#true} is VALID [2022-04-28 15:28:40,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-28 15:28:40,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25225#true} {25225#true} #690#return; {25225#true} is VALID [2022-04-28 15:28:40,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {25225#true} call ULTIMATE.init(); {25232#(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-28 15:28:40,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {25232#(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(196, 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); {25225#true} is VALID [2022-04-28 15:28:40,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-28 15:28:40,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25225#true} {25225#true} #690#return; {25225#true} is VALID [2022-04-28 15:28:40,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {25225#true} call #t~ret161 := main(); {25225#true} is VALID [2022-04-28 15:28:40,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {25225#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {25225#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L272 TraceCheckUtils]: 7: Hoare triple {25225#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {25225#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {25225#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {25225#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {25225#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {25225#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {25225#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {25225#true} assume !false; {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {25225#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {25225#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {25225#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {25225#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {25225#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {25225#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {25225#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {25225#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {25225#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:40,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {25225#true} assume 8464 == #t~mem55;havoc #t~mem55; {25225#true} is VALID [2022-04-28 15:28:40,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {25225#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25225#true} is VALID [2022-04-28 15:28:40,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {25225#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25225#true} is VALID [2022-04-28 15:28:40,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {25225#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} ~skip~0 := 0; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !false; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:40,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25231#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-28 15:28:40,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {25231#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {25226#false} is VALID [2022-04-28 15:28:40,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {25226#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25226#false} is VALID [2022-04-28 15:28:40,703 INFO L290 TraceCheckUtils]: 64: Hoare triple {25226#false} assume !(4 == ~blastFlag~0); {25226#false} is VALID [2022-04-28 15:28:40,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {25226#false} assume 5 == ~blastFlag~0; {25226#false} is VALID [2022-04-28 15:28:40,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {25226#false} assume !false; {25226#false} is VALID [2022-04-28 15:28:40,704 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-28 15:28:40,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:40,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975743031] [2022-04-28 15:28:40,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975743031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:40,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:40,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:40,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:40,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [212003666] [2022-04-28 15:28:40,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [212003666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:40,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:40,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:40,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197717509] [2022-04-28 15:28:40,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:40,706 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-28 15:28:40,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:40,706 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-28 15:28:40,760 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-28 15:28:40,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:40,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:40,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:40,760 INFO L87 Difference]: Start difference. First operand 250 states and 387 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-28 15:28:44,073 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-28 15:28:46,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:48,103 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-28 15:28:50,130 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-28 15:28:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:51,232 INFO L93 Difference]: Finished difference Result 563 states and 876 transitions. [2022-04-28 15:28:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:51,232 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-28 15:28:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:51,232 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-28 15:28:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:28:51,235 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-28 15:28:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:28:51,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-28 15:28:51,574 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-28 15:28:51,588 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:28:51,588 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:28:51,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:51,596 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 119 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:51,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 366 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 483 Invalid, 3 Unknown, 0 Unchecked, 7.7s Time] [2022-04-28 15:28:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:28:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-28 15:28:51,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:51,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:51,605 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:51,605 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:51,609 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-28 15:28:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-28 15:28:51,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:51,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:51,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:51,610 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:51,615 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-28 15:28:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-28 15:28:51,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:51,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:51,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:51,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-28 15:28:51,619 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 67 [2022-04-28 15:28:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:51,619 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-28 15:28:51,620 INFO L496 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-28 15:28:51,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 408 transitions. [2022-04-28 15:28:51,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-28 15:28:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 15:28:51,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:51,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-04-28 15:28:51,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:28:51,918 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 1 times [2022-04-28 15:28:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:51,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558050491] [2022-04-28 15:28:51,985 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:28:51,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:51,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 2 times [2022-04-28 15:28:51,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:51,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690137481] [2022-04-28 15:28:51,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:51,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:52,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {27570#(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(196, 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); {27563#true} is VALID [2022-04-28 15:28:52,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-28 15:28:52,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27563#true} {27563#true} #690#return; {27563#true} is VALID [2022-04-28 15:28:52,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {27563#true} call ULTIMATE.init(); {27570#(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-28 15:28:52,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {27570#(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(196, 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); {27563#true} is VALID [2022-04-28 15:28:52,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-28 15:28:52,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27563#true} {27563#true} #690#return; {27563#true} is VALID [2022-04-28 15:28:52,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {27563#true} call #t~ret161 := main(); {27563#true} is VALID [2022-04-28 15:28:52,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {27563#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27563#true} is VALID [2022-04-28 15:28:52,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {27563#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L272 TraceCheckUtils]: 7: Hoare triple {27563#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {27563#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {27563#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {27563#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {27563#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {27563#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {27563#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {27563#true} assume !false; {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {27563#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {27563#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {27563#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {27563#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {27563#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {27563#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {27563#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {27563#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {27563#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:52,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {27563#true} assume 8464 == #t~mem55;havoc #t~mem55; {27563#true} is VALID [2022-04-28 15:28:52,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {27563#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27563#true} is VALID [2022-04-28 15:28:52,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {27563#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27563#true} is VALID [2022-04-28 15:28:52,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {27563#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:52,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27569#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {27569#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {27564#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {27564#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {27564#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {27564#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {27564#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {27564#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {27564#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {27564#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {27564#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {27564#false} ~skip~0 := 0; {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 60: Hoare triple {27564#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {27564#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {27564#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {27564#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {27564#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 65: Hoare triple {27564#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {27564#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {27564#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {27564#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 69: Hoare triple {27564#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 70: Hoare triple {27564#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,103 INFO L290 TraceCheckUtils]: 71: Hoare triple {27564#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 72: Hoare triple {27564#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 73: Hoare triple {27564#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 74: Hoare triple {27564#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {27564#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {27564#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {27564#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {27564#false} assume 8544 == #t~mem64;havoc #t~mem64; {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 79: Hoare triple {27564#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {27564#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 81: Hoare triple {27564#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 82: Hoare triple {27564#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {27564#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {27564#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {27564#false} is VALID [2022-04-28 15:28:52,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {27564#false} assume 7 == ~blastFlag~0; {27564#false} is VALID [2022-04-28 15:28:52,105 INFO L290 TraceCheckUtils]: 86: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-28 15:28:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:28:52,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:52,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690137481] [2022-04-28 15:28:52,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690137481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:52,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:52,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:52,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:52,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558050491] [2022-04-28 15:28:52,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558050491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:52,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:52,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480601116] [2022-04-28 15:28:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:52,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 15:28:52,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:52,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:52,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:52,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:52,165 INFO L87 Difference]: Start difference. First operand 261 states and 408 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:53,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:56,871 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-28 15:28:59,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:03,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:04,126 INFO L93 Difference]: Finished difference Result 614 states and 963 transitions. [2022-04-28 15:29:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 15:29:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:29:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:29:04,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 15:29:04,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:04,506 INFO L225 Difference]: With dead ends: 614 [2022-04-28 15:29:04,506 INFO L226 Difference]: Without dead ends: 379 [2022-04-28 15:29:04,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:04,507 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 132 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:04,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 366 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 15:29:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-28 15:29:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 287. [2022-04-28 15:29:04,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:04,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,531 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,532 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:04,537 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-28 15:29:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-28 15:29:04,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:04,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:04,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-28 15:29:04,538 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-28 15:29:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:04,543 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-28 15:29:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-28 15:29:04,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:04,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:04,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:04,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 448 transitions. [2022-04-28 15:29:04,548 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 448 transitions. Word has length 87 [2022-04-28 15:29:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:04,548 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 448 transitions. [2022-04-28 15:29:04,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 448 transitions. [2022-04-28 15:29:04,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 448 transitions. [2022-04-28 15:29:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:29:04,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:04,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:04,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:29:04,904 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:04,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash 684844099, now seen corresponding path program 1 times [2022-04-28 15:29:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:04,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [987472096] [2022-04-28 15:29:04,947 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:04,947 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash 684844099, now seen corresponding path program 2 times [2022-04-28 15:29:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:04,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907256685] [2022-04-28 15:29:04,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:04,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:05,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {30142#(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(196, 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); {30135#true} is VALID [2022-04-28 15:29:05,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-28 15:29:05,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30135#true} {30135#true} #690#return; {30135#true} is VALID [2022-04-28 15:29:05,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {30135#true} call ULTIMATE.init(); {30142#(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-28 15:29:05,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {30142#(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(196, 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); {30135#true} is VALID [2022-04-28 15:29:05,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-28 15:29:05,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30135#true} {30135#true} #690#return; {30135#true} is VALID [2022-04-28 15:29:05,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {30135#true} call #t~ret161 := main(); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {30135#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {30135#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L272 TraceCheckUtils]: 7: Hoare triple {30135#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {30135#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {30135#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {30135#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {30135#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {30135#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {30135#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {30135#true} assume !false; {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {30135#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {30135#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {30135#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {30135#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {30135#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {30135#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {30135#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {30135#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {30135#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:29:05,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {30135#true} assume 8464 == #t~mem55;havoc #t~mem55; {30135#true} is VALID [2022-04-28 15:29:05,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {30135#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30135#true} is VALID [2022-04-28 15:29:05,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {30135#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30135#true} is VALID [2022-04-28 15:29:05,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {30135#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} ~skip~0 := 0; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !false; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:29:05,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30141#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-28 15:29:05,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {30141#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {30136#false} is VALID [2022-04-28 15:29:05,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {30136#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {30136#false} is VALID [2022-04-28 15:29:05,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {30136#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {30136#false} is VALID [2022-04-28 15:29:05,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {30136#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {30136#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {30136#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {30136#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {30136#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {30136#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {30136#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {30136#false} ~skip~0 := 0; {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {30136#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {30136#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 63: Hoare triple {30136#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 64: Hoare triple {30136#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 65: Hoare triple {30136#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 66: Hoare triple {30136#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,059 INFO L290 TraceCheckUtils]: 67: Hoare triple {30136#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {30136#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {30136#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {30136#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 71: Hoare triple {30136#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {30136#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 73: Hoare triple {30136#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {30136#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 75: Hoare triple {30136#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {30136#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 77: Hoare triple {30136#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 78: Hoare triple {30136#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 79: Hoare triple {30136#false} assume 8544 == #t~mem64;havoc #t~mem64; {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 80: Hoare triple {30136#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:29:05,060 INFO L290 TraceCheckUtils]: 81: Hoare triple {30136#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {30136#false} is VALID [2022-04-28 15:29:05,061 INFO L290 TraceCheckUtils]: 82: Hoare triple {30136#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {30136#false} is VALID [2022-04-28 15:29:05,061 INFO L290 TraceCheckUtils]: 83: Hoare triple {30136#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {30136#false} is VALID [2022-04-28 15:29:05,061 INFO L290 TraceCheckUtils]: 84: Hoare triple {30136#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {30136#false} is VALID [2022-04-28 15:29:05,061 INFO L290 TraceCheckUtils]: 85: Hoare triple {30136#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {30136#false} is VALID [2022-04-28 15:29:05,061 INFO L290 TraceCheckUtils]: 86: Hoare triple {30136#false} assume 7 == ~blastFlag~0; {30136#false} is VALID [2022-04-28 15:29:05,061 INFO L290 TraceCheckUtils]: 87: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-28 15:29:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:29:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:05,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907256685] [2022-04-28 15:29:05,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907256685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:05,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:05,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:05,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:05,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [987472096] [2022-04-28 15:29:05,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [987472096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:05,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:05,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:05,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813424489] [2022-04-28 15:29:05,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:05,062 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 88 [2022-04-28 15:29:05,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:05,063 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-28 15:29:05,122 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-28 15:29:05,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:05,122 INFO L87 Difference]: Start difference. First operand 287 states and 448 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-28 15:29:10,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:14,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:15,679 INFO L93 Difference]: Finished difference Result 626 states and 976 transitions. [2022-04-28 15:29:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:15,679 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 88 [2022-04-28 15:29:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:15,680 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-28 15:29:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:29:15,684 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-28 15:29:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:29:15,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 15:29:16,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:16,079 INFO L225 Difference]: With dead ends: 626 [2022-04-28 15:29:16,079 INFO L226 Difference]: Without dead ends: 365 [2022-04-28 15:29:16,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:16,081 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 131 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:16,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 402 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:29:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-28 15:29:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2022-04-28 15:29:16,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:16,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:16,105 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:16,105 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:16,111 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-28 15:29:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-28 15:29:16,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:16,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:16,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-28 15:29:16,112 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-28 15:29:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:16,117 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-28 15:29:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-28 15:29:16,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:16,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:16,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:16,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2022-04-28 15:29:16,121 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 88 [2022-04-28 15:29:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:16,122 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2022-04-28 15:29:16,122 INFO L496 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-28 15:29:16,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 445 transitions. [2022-04-28 15:29:16,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2022-04-28 15:29:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:29:16,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:16,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:16,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:29:16,408 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:16,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1964115669, now seen corresponding path program 1 times [2022-04-28 15:29:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:16,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1724220483] [2022-04-28 15:29:16,435 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:16,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1964115669, now seen corresponding path program 2 times [2022-04-28 15:29:16,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:16,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023907993] [2022-04-28 15:29:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:16,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:16,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {32710#(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(196, 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); {32703#true} is VALID [2022-04-28 15:29:16,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-28 15:29:16,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32703#true} {32703#true} #690#return; {32703#true} is VALID [2022-04-28 15:29:16,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {32703#true} call ULTIMATE.init(); {32710#(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-28 15:29:16,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {32710#(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(196, 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); {32703#true} is VALID [2022-04-28 15:29:16,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-28 15:29:16,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32703#true} {32703#true} #690#return; {32703#true} is VALID [2022-04-28 15:29:16,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {32703#true} call #t~ret161 := main(); {32703#true} is VALID [2022-04-28 15:29:16,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {32703#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32703#true} is VALID [2022-04-28 15:29:16,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {32703#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32703#true} is VALID [2022-04-28 15:29:16,529 INFO L272 TraceCheckUtils]: 7: Hoare triple {32703#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {32703#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {32703#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {32703#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {32703#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {32703#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {32703#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {32703#true} assume !false; {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {32703#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {32703#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {32703#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {32703#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {32703#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {32703#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {32703#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {32703#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {32703#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:29:16,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {32703#true} assume 8464 == #t~mem55;havoc #t~mem55; {32703#true} is VALID [2022-04-28 15:29:16,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {32703#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32703#true} is VALID [2022-04-28 15:29:16,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {32703#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32703#true} is VALID [2022-04-28 15:29:16,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {32703#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:16,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32709#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-28 15:29:16,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {32709#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {32704#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {32704#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {32704#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {32704#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {32704#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {32704#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {32704#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {32704#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {32704#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {32704#false} assume 8448 == #t~mem68;havoc #t~mem68; {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 55: Hoare triple {32704#false} assume !(~num1~0 > 0); {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {32704#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {32704#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 58: Hoare triple {32704#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 59: Hoare triple {32704#false} ~skip~0 := 0; {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 60: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {32704#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {32704#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 63: Hoare triple {32704#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 64: Hoare triple {32704#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {32704#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {32704#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 67: Hoare triple {32704#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {32704#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {32704#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {32704#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 71: Hoare triple {32704#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {32704#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {32704#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {32704#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 75: Hoare triple {32704#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 76: Hoare triple {32704#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {32704#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 78: Hoare triple {32704#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {32704#false} assume 8544 == #t~mem64;havoc #t~mem64; {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {32704#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {32704#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 82: Hoare triple {32704#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 83: Hoare triple {32704#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 84: Hoare triple {32704#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 85: Hoare triple {32704#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 86: Hoare triple {32704#false} assume 7 == ~blastFlag~0; {32704#false} is VALID [2022-04-28 15:29:16,540 INFO L290 TraceCheckUtils]: 87: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-28 15:29:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 15:29:16,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:16,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023907993] [2022-04-28 15:29:16,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023907993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:16,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:16,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:16,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:16,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1724220483] [2022-04-28 15:29:16,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1724220483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:16,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:16,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:16,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570507783] [2022-04-28 15:29:16,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:16,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:29:16,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:16,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:16,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:16,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:16,596 INFO L87 Difference]: Start difference. First operand 287 states and 445 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:18,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:19,540 INFO L93 Difference]: Finished difference Result 590 states and 921 transitions. [2022-04-28 15:29:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:19,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:29:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:29:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:29:19,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 15:29:19,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:19,846 INFO L225 Difference]: With dead ends: 590 [2022-04-28 15:29:19,846 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:29:19,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:19,848 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:19,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 505 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:29:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:29:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:29:19,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:19,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:19,875 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:19,875 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:19,880 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:29:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:29:19,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:19,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:19,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:29:19,881 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:29:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:19,885 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:29:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:29:19,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:19,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:19,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:19,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 479 transitions. [2022-04-28 15:29:19,890 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 479 transitions. Word has length 88 [2022-04-28 15:29:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:19,890 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 479 transitions. [2022-04-28 15:29:19,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:19,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 479 transitions. [2022-04-28 15:29:20,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 479 transitions. [2022-04-28 15:29:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 15:29:20,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:20,258 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:20,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:29:20,258 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1847172772, now seen corresponding path program 1 times [2022-04-28 15:29:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:20,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053257549] [2022-04-28 15:29:20,310 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:20,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1847172772, now seen corresponding path program 2 times [2022-04-28 15:29:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:20,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826601152] [2022-04-28 15:29:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:20,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:20,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {35178#(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(196, 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); {35171#true} is VALID [2022-04-28 15:29:20,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-28 15:29:20,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35171#true} {35171#true} #690#return; {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {35171#true} call ULTIMATE.init(); {35178#(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-28 15:29:20,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {35178#(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(196, 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); {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35171#true} {35171#true} #690#return; {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {35171#true} call #t~ret161 := main(); {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {35171#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {35171#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L272 TraceCheckUtils]: 7: Hoare triple {35171#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {35171#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {35171#true} is VALID [2022-04-28 15:29:20,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {35171#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {35171#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {35171#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {35171#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {35171#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {35171#true} assume !false; {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {35171#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {35171#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {35171#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {35171#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {35171#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {35171#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {35171#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {35171#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {35171#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:20,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {35171#true} assume 8464 == #t~mem55;havoc #t~mem55; {35171#true} is VALID [2022-04-28 15:29:20,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {35171#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35171#true} is VALID [2022-04-28 15:29:20,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {35171#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35171#true} is VALID [2022-04-28 15:29:20,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {35171#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:20,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35177#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {35177#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {35172#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {35172#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {35172#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {35172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {35172#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {35172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {35172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {35172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {35172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {35172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {35172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 52: Hoare triple {35172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {35172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 54: Hoare triple {35172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 55: Hoare triple {35172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {35172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 57: Hoare triple {35172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 58: Hoare triple {35172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 59: Hoare triple {35172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 60: Hoare triple {35172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {35172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,414 INFO L290 TraceCheckUtils]: 62: Hoare triple {35172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 63: Hoare triple {35172#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 64: Hoare triple {35172#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 65: Hoare triple {35172#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 66: Hoare triple {35172#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 67: Hoare triple {35172#false} assume 8448 == #t~mem68;havoc #t~mem68; {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 68: Hoare triple {35172#false} assume !(~num1~0 > 0); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 69: Hoare triple {35172#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 70: Hoare triple {35172#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 71: Hoare triple {35172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 72: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 73: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 74: Hoare triple {35172#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 75: Hoare triple {35172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {35172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 77: Hoare triple {35172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 78: Hoare triple {35172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 79: Hoare triple {35172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {35172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 81: Hoare triple {35172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 82: Hoare triple {35172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 83: Hoare triple {35172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {35172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {35172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {35172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 87: Hoare triple {35172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {35172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {35172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {35172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {35172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 92: Hoare triple {35172#false} assume 8544 == #t~mem64;havoc #t~mem64; {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 93: Hoare triple {35172#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 94: Hoare triple {35172#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {35172#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 96: Hoare triple {35172#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 97: Hoare triple {35172#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 98: Hoare triple {35172#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 99: Hoare triple {35172#false} assume 7 == ~blastFlag~0; {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L290 TraceCheckUtils]: 100: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:29:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:29:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826601152] [2022-04-28 15:29:20,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826601152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:20,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:20,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:20,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053257549] [2022-04-28 15:29:20,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053257549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:20,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:20,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589342470] [2022-04-28 15:29:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:20,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 15:29:20,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:20,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:20,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:20,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:20,466 INFO L87 Difference]: Start difference. First operand 309 states and 479 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:23,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:26,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:29,633 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-28 15:29:32,787 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-28 15:29:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:33,668 INFO L93 Difference]: Finished difference Result 612 states and 954 transitions. [2022-04-28 15:29:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:33,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 15:29:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:29:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:29:33,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-28 15:29:33,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:33,962 INFO L225 Difference]: With dead ends: 612 [2022-04-28 15:29:33,962 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:29:33,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:33,963 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:33,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 505 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 15:29:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:29:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:29:33,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:33,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:33,975 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:33,975 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:33,979 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:29:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:29:33,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:33,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:33,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:29:33,980 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:29:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:33,987 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:29:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:29:33,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:33,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:33,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:33,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2022-04-28 15:29:33,993 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 101 [2022-04-28 15:29:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:33,993 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2022-04-28 15:29:33,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:33,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 478 transitions. [2022-04-28 15:29:34,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2022-04-28 15:29:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:29:34,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:34,284 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:34,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:29:34,284 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1251719941, now seen corresponding path program 1 times [2022-04-28 15:29:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:34,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299016589] [2022-04-28 15:29:34,350 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:34,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1251719941, now seen corresponding path program 2 times [2022-04-28 15:29:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:34,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474392990] [2022-04-28 15:29:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:34,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {37690#(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(196, 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); {37683#true} is VALID [2022-04-28 15:29:34,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-28 15:29:34,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37683#true} {37683#true} #690#return; {37683#true} is VALID [2022-04-28 15:29:34,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {37683#true} call ULTIMATE.init(); {37690#(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-28 15:29:34,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {37690#(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(196, 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); {37683#true} is VALID [2022-04-28 15:29:34,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-28 15:29:34,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37683#true} {37683#true} #690#return; {37683#true} is VALID [2022-04-28 15:29:34,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {37683#true} call #t~ret161 := main(); {37683#true} is VALID [2022-04-28 15:29:34,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {37683#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37683#true} is VALID [2022-04-28 15:29:34,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {37683#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {37683#true} is VALID [2022-04-28 15:29:34,453 INFO L272 TraceCheckUtils]: 7: Hoare triple {37683#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {37683#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {37683#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {37683#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {37683#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {37683#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {37683#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {37683#true} assume !false; {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {37683#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {37683#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {37683#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {37683#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {37683#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {37683#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {37683#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {37683#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {37683#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:34,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {37683#true} assume 8464 == #t~mem55;havoc #t~mem55; {37683#true} is VALID [2022-04-28 15:29:34,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {37683#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37683#true} is VALID [2022-04-28 15:29:34,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {37683#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37683#true} is VALID [2022-04-28 15:29:34,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {37683#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} ~skip~0 := 0; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !false; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37689#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {37689#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {37684#false} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {37684#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {37684#false} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {37684#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {37684#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {37684#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37684#false} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:29:34,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {37684#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {37684#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {37684#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {37684#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {37684#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {37684#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {37684#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {37684#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {37684#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {37684#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {37684#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {37684#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 58: Hoare triple {37684#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 59: Hoare triple {37684#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 60: Hoare triple {37684#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,461 INFO L290 TraceCheckUtils]: 61: Hoare triple {37684#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {37684#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 63: Hoare triple {37684#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {37684#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {37684#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 66: Hoare triple {37684#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {37684#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {37684#false} assume 8448 == #t~mem68;havoc #t~mem68; {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 69: Hoare triple {37684#false} assume !(~num1~0 > 0); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 70: Hoare triple {37684#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 71: Hoare triple {37684#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {37684#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 73: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 74: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:29:34,462 INFO L290 TraceCheckUtils]: 75: Hoare triple {37684#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 76: Hoare triple {37684#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 77: Hoare triple {37684#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {37684#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 79: Hoare triple {37684#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 80: Hoare triple {37684#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 81: Hoare triple {37684#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 82: Hoare triple {37684#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 83: Hoare triple {37684#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 84: Hoare triple {37684#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 85: Hoare triple {37684#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 86: Hoare triple {37684#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 87: Hoare triple {37684#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {37684#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {37684#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {37684#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 91: Hoare triple {37684#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {37684#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 93: Hoare triple {37684#false} assume 8544 == #t~mem64;havoc #t~mem64; {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 94: Hoare triple {37684#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {37684#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {37684#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {37684#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 98: Hoare triple {37684#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 99: Hoare triple {37684#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 100: Hoare triple {37684#false} assume 7 == ~blastFlag~0; {37684#false} is VALID [2022-04-28 15:29:34,464 INFO L290 TraceCheckUtils]: 101: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:29:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:29:34,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:34,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474392990] [2022-04-28 15:29:34,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474392990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:34,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:34,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:34,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:34,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299016589] [2022-04-28 15:29:34,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299016589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:34,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:34,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373418904] [2022-04-28 15:29:34,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:34,466 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 102 [2022-04-28 15:29:34,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:34,467 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-28 15:29:34,542 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-28 15:29:34,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:34,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:34,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:34,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:34,543 INFO L87 Difference]: Start difference. First operand 309 states and 478 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-28 15:29:43,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:44,310 INFO L93 Difference]: Finished difference Result 670 states and 1036 transitions. [2022-04-28 15:29:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:44,311 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 102 [2022-04-28 15:29:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:44,311 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-28 15:29:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:29:44,313 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-28 15:29:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:29:44,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-28 15:29:44,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:44,654 INFO L225 Difference]: With dead ends: 670 [2022-04-28 15:29:44,655 INFO L226 Difference]: Without dead ends: 387 [2022-04-28 15:29:44,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:44,655 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 140 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:44,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 402 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 15:29:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-28 15:29:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 309. [2022-04-28 15:29:44,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:44,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:44,668 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:44,668 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:44,673 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-28 15:29:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-28 15:29:44,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:44,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:44,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-28 15:29:44,674 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-28 15:29:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:44,680 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-28 15:29:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-28 15:29:44,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:44,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:44,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:44,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-04-28 15:29:44,685 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 102 [2022-04-28 15:29:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:44,686 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-04-28 15:29:44,686 INFO L496 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-28 15:29:44,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 473 transitions. [2022-04-28 15:29:45,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-04-28 15:29:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:29:45,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:45,063 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:45,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:29:45,063 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1560968036, now seen corresponding path program 1 times [2022-04-28 15:29:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:45,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597605125] [2022-04-28 15:29:45,117 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:45,117 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1560968036, now seen corresponding path program 2 times [2022-04-28 15:29:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:45,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715730343] [2022-04-28 15:29:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:45,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {40434#(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(196, 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); {40427#true} is VALID [2022-04-28 15:29:45,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-28 15:29:45,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40427#true} {40427#true} #690#return; {40427#true} is VALID [2022-04-28 15:29:45,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {40427#true} call ULTIMATE.init(); {40434#(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-28 15:29:45,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {40434#(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(196, 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); {40427#true} is VALID [2022-04-28 15:29:45,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-28 15:29:45,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40427#true} {40427#true} #690#return; {40427#true} is VALID [2022-04-28 15:29:45,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {40427#true} call #t~ret161 := main(); {40427#true} is VALID [2022-04-28 15:29:45,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {40427#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40427#true} is VALID [2022-04-28 15:29:45,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {40427#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {40427#true} is VALID [2022-04-28 15:29:45,209 INFO L272 TraceCheckUtils]: 7: Hoare triple {40427#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {40427#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {40427#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {40427#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {40427#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {40427#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {40427#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {40427#true} assume !false; {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {40427#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {40427#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {40427#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {40427#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {40427#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {40427#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {40427#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {40427#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {40427#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:45,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {40427#true} assume 8464 == #t~mem55;havoc #t~mem55; {40427#true} is VALID [2022-04-28 15:29:45,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {40427#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40427#true} is VALID [2022-04-28 15:29:45,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {40427#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40427#true} is VALID [2022-04-28 15:29:45,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {40427#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40433#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {40433#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {40428#false} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {40428#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {40428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {40428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40428#false} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {40428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {40428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {40428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {40428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {40428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {40428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {40428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 53: Hoare triple {40428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {40428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {40428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {40428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {40428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {40428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {40428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {40428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {40428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {40428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {40428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 64: Hoare triple {40428#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 65: Hoare triple {40428#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 66: Hoare triple {40428#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {40428#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {40428#false} assume 8448 == #t~mem68;havoc #t~mem68; {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 69: Hoare triple {40428#false} assume !(~num1~0 > 0); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 70: Hoare triple {40428#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 71: Hoare triple {40428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {40428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 73: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 74: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 75: Hoare triple {40428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 76: Hoare triple {40428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,218 INFO L290 TraceCheckUtils]: 77: Hoare triple {40428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 78: Hoare triple {40428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 79: Hoare triple {40428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 80: Hoare triple {40428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 81: Hoare triple {40428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 82: Hoare triple {40428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 83: Hoare triple {40428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 84: Hoare triple {40428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 85: Hoare triple {40428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 86: Hoare triple {40428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 87: Hoare triple {40428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 88: Hoare triple {40428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 89: Hoare triple {40428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 90: Hoare triple {40428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,219 INFO L290 TraceCheckUtils]: 91: Hoare triple {40428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 92: Hoare triple {40428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 93: Hoare triple {40428#false} assume 8544 == #t~mem64;havoc #t~mem64; {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 94: Hoare triple {40428#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 95: Hoare triple {40428#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 96: Hoare triple {40428#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 97: Hoare triple {40428#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 98: Hoare triple {40428#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 99: Hoare triple {40428#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 100: Hoare triple {40428#false} assume 7 == ~blastFlag~0; {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L290 TraceCheckUtils]: 101: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:29:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:29:45,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:45,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715730343] [2022-04-28 15:29:45,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715730343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:45,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:45,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:45,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:45,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597605125] [2022-04-28 15:29:45,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597605125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:45,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:45,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:45,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72589444] [2022-04-28 15:29:45,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:45,222 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 102 [2022-04-28 15:29:45,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:45,222 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-28 15:29:45,274 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-28 15:29:45,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:45,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:45,275 INFO L87 Difference]: Start difference. First operand 309 states and 473 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-28 15:29:50,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:52,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:55,133 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-28 15:29:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:56,035 INFO L93 Difference]: Finished difference Result 609 states and 939 transitions. [2022-04-28 15:29:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:56,035 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 102 [2022-04-28 15:29:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:56,035 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-28 15:29:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:29:56,037 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-28 15:29:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:29:56,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 15:29:56,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:56,330 INFO L225 Difference]: With dead ends: 609 [2022-04-28 15:29:56,330 INFO L226 Difference]: Without dead ends: 326 [2022-04-28 15:29:56,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:56,331 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:56,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 511 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 15:29:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-28 15:29:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2022-04-28 15:29:56,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:56,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:56,343 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:56,344 INFO L87 Difference]: Start difference. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:56,348 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:29:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:29:56,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:56,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:56,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 326 states. [2022-04-28 15:29:56,349 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 326 states. [2022-04-28 15:29:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:56,355 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:29:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:29:56,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:56,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:56,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:56,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2022-04-28 15:29:56,362 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 102 [2022-04-28 15:29:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:56,362 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2022-04-28 15:29:56,362 INFO L496 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-28 15:29:56,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 472 transitions. [2022-04-28 15:29:56,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2022-04-28 15:29:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 15:29:56,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:56,676 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:56,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:29:56,677 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash -472074122, now seen corresponding path program 1 times [2022-04-28 15:29:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:56,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248174437] [2022-04-28 15:29:56,746 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:56,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash -472074122, now seen corresponding path program 2 times [2022-04-28 15:29:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:56,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606814519] [2022-04-28 15:29:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:56,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {42934#(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(196, 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); {42927#true} is VALID [2022-04-28 15:29:56,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-28 15:29:56,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42927#true} {42927#true} #690#return; {42927#true} is VALID [2022-04-28 15:29:56,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {42927#true} call ULTIMATE.init(); {42934#(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-28 15:29:56,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {42934#(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(196, 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); {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42927#true} {42927#true} #690#return; {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {42927#true} call #t~ret161 := main(); {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {42927#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {42927#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L272 TraceCheckUtils]: 7: Hoare triple {42927#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {42927#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {42927#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {42927#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {42927#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {42927#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {42927#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-28 15:29:56,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {42927#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {42927#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {42927#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {42927#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {42927#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {42927#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {42927#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {42927#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {42927#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {42927#true} assume 8464 == #t~mem55;havoc #t~mem55; {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {42927#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {42927#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {42927#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {42927#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {42927#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {42927#true} ~skip~0 := 0; {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {42927#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {42927#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {42927#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {42927#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {42927#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {42927#true} assume 8195 == #t~mem51;havoc #t~mem51; {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {42927#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {42927#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {42927#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {42927#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, 80 + ~s.offset, 8); {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {42927#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {42927#true} is VALID [2022-04-28 15:29:56,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {42927#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:56,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {42927#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42933#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 55: Hoare triple {42933#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {42928#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {42928#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {42928#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {42928#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {42928#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {42928#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,852 INFO L290 TraceCheckUtils]: 62: Hoare triple {42928#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {42928#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {42928#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {42928#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 66: Hoare triple {42928#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 67: Hoare triple {42928#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 68: Hoare triple {42928#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {42928#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {42928#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {42928#false} assume 8448 == #t~mem68;havoc #t~mem68; {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {42928#false} assume !(~num1~0 > 0); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 73: Hoare triple {42928#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 74: Hoare triple {42928#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 75: Hoare triple {42928#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42928#false} is VALID [2022-04-28 15:29:56,853 INFO L290 TraceCheckUtils]: 76: Hoare triple {42928#false} ~skip~0 := 0; {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {42928#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 79: Hoare triple {42928#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 80: Hoare triple {42928#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 81: Hoare triple {42928#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 82: Hoare triple {42928#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 83: Hoare triple {42928#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 84: Hoare triple {42928#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 85: Hoare triple {42928#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 86: Hoare triple {42928#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 87: Hoare triple {42928#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 88: Hoare triple {42928#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 89: Hoare triple {42928#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 90: Hoare triple {42928#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,854 INFO L290 TraceCheckUtils]: 91: Hoare triple {42928#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 92: Hoare triple {42928#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 93: Hoare triple {42928#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 94: Hoare triple {42928#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 95: Hoare triple {42928#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 96: Hoare triple {42928#false} assume 8544 == #t~mem64;havoc #t~mem64; {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 97: Hoare triple {42928#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 98: Hoare triple {42928#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 99: Hoare triple {42928#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 100: Hoare triple {42928#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 101: Hoare triple {42928#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 102: Hoare triple {42928#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 103: Hoare triple {42928#false} assume 7 == ~blastFlag~0; {42928#false} is VALID [2022-04-28 15:29:56,855 INFO L290 TraceCheckUtils]: 104: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-28 15:29:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 15:29:56,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:56,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606814519] [2022-04-28 15:29:56,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606814519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:56,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:56,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:56,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:56,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248174437] [2022-04-28 15:29:56,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248174437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:56,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:56,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427829803] [2022-04-28 15:29:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:56,857 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 105 [2022-04-28 15:29:56,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:56,858 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-28 15:29:56,918 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-28 15:29:56,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:56,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:56,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:56,921 INFO L87 Difference]: Start difference. First operand 309 states and 472 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-28 15:30:00,132 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-28 15:30:04,861 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-28 15:30:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:06,851 INFO L93 Difference]: Finished difference Result 620 states and 952 transitions. [2022-04-28 15:30:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:06,851 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 105 [2022-04-28 15:30:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:06,852 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-28 15:30:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:30:06,853 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-28 15:30:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:30:06,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-28 15:30:07,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:07,114 INFO L225 Difference]: With dead ends: 620 [2022-04-28 15:30:07,114 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:30:07,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:07,116 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 18 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:07,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 15:30:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:30:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-28 15:30:07,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:07,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:07,134 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:07,135 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:07,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:07,139 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:30:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:30:07,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:07,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:07,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states 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-28 15:30:07,140 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states 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-28 15:30:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:07,144 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:30:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:30:07,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:07,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:07,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:07,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 494 transitions. [2022-04-28 15:30:07,150 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 494 transitions. Word has length 105 [2022-04-28 15:30:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:07,150 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 494 transitions. [2022-04-28 15:30:07,150 INFO L496 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-28 15:30:07,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 494 transitions. [2022-04-28 15:30:07,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 494 transitions. [2022-04-28 15:30:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 15:30:07,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:07,549 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:30:07,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:30:07,549 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash -888676307, now seen corresponding path program 1 times [2022-04-28 15:30:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:07,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [214480351] [2022-04-28 15:30:07,604 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:07,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash -888676307, now seen corresponding path program 2 times [2022-04-28 15:30:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:07,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735556340] [2022-04-28 15:30:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:07,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:07,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {45510#(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(196, 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); {45503#true} is VALID [2022-04-28 15:30:07,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-28 15:30:07,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45503#true} {45503#true} #690#return; {45503#true} is VALID [2022-04-28 15:30:07,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {45503#true} call ULTIMATE.init(); {45510#(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-28 15:30:07,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {45510#(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(196, 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); {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45503#true} {45503#true} #690#return; {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {45503#true} call #t~ret161 := main(); {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {45503#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {45503#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L272 TraceCheckUtils]: 7: Hoare triple {45503#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {45503#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {45503#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {45503#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {45503#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {45503#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {45503#true} is VALID [2022-04-28 15:30:07,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {45503#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {45503#true} assume !false; {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {45503#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {45503#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {45503#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {45503#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {45503#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {45503#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {45503#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {45503#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {45503#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {45503#true} assume 8464 == #t~mem55;havoc #t~mem55; {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {45503#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45503#true} is VALID [2022-04-28 15:30:07,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {45503#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45503#true} is VALID [2022-04-28 15:30:07,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {45503#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:07,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45509#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-28 15:30:07,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {45509#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {45504#false} is VALID [2022-04-28 15:30:07,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {45504#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {45504#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {45504#false} is VALID [2022-04-28 15:30:07,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {45504#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {45504#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, 80 + ~s.offset, 8); {45504#false} is VALID [2022-04-28 15:30:07,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {45504#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {45504#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {45504#false} assume 12292 != #t~mem85;havoc #t~mem85; {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {45504#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {45504#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 47: Hoare triple {45504#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {45504#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {45504#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {45504#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {45504#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {45504#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 55: Hoare triple {45504#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {45504#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {45504#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {45504#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 59: Hoare triple {45504#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 60: Hoare triple {45504#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {45504#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {45504#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {45504#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {45504#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {45504#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {45504#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 67: Hoare triple {45504#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 68: Hoare triple {45504#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,713 INFO L290 TraceCheckUtils]: 69: Hoare triple {45504#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {45504#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 71: Hoare triple {45504#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 72: Hoare triple {45504#false} assume 8448 == #t~mem68;havoc #t~mem68; {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {45504#false} assume !(~num1~0 > 0); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 74: Hoare triple {45504#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {45504#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 76: Hoare triple {45504#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 77: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {45504#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {45504#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 81: Hoare triple {45504#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {45504#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {45504#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {45504#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 85: Hoare triple {45504#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 86: Hoare triple {45504#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 87: Hoare triple {45504#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 88: Hoare triple {45504#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {45504#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 90: Hoare triple {45504#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 91: Hoare triple {45504#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 92: Hoare triple {45504#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 93: Hoare triple {45504#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 94: Hoare triple {45504#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 95: Hoare triple {45504#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 96: Hoare triple {45504#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 97: Hoare triple {45504#false} assume 8544 == #t~mem64;havoc #t~mem64; {45504#false} is VALID [2022-04-28 15:30:07,715 INFO L290 TraceCheckUtils]: 98: Hoare triple {45504#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:30:07,716 INFO L290 TraceCheckUtils]: 99: Hoare triple {45504#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {45504#false} is VALID [2022-04-28 15:30:07,716 INFO L290 TraceCheckUtils]: 100: Hoare triple {45504#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {45504#false} is VALID [2022-04-28 15:30:07,716 INFO L290 TraceCheckUtils]: 101: Hoare triple {45504#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {45504#false} is VALID [2022-04-28 15:30:07,716 INFO L290 TraceCheckUtils]: 102: Hoare triple {45504#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {45504#false} is VALID [2022-04-28 15:30:07,716 INFO L290 TraceCheckUtils]: 103: Hoare triple {45504#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {45504#false} is VALID [2022-04-28 15:30:07,716 INFO L290 TraceCheckUtils]: 104: Hoare triple {45504#false} assume 7 == ~blastFlag~0; {45504#false} is VALID [2022-04-28 15:30:07,716 INFO L290 TraceCheckUtils]: 105: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:30:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:30:07,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:07,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735556340] [2022-04-28 15:30:07,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735556340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:07,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:07,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:07,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:07,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [214480351] [2022-04-28 15:30:07,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [214480351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:07,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:07,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:07,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254048160] [2022-04-28 15:30:07,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:07,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 15:30:07,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:07,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:07,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:07,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:07,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:07,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:07,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:07,773 INFO L87 Difference]: Start difference. First operand 325 states and 494 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:13,899 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-28 15:30:15,740 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-28 15:30:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:19,826 INFO L93 Difference]: Finished difference Result 692 states and 1055 transitions. [2022-04-28 15:30:19,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:19,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 15:30:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-28 15:30:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-28 15:30:19,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-28 15:30:20,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:20,199 INFO L225 Difference]: With dead ends: 692 [2022-04-28 15:30:20,199 INFO L226 Difference]: Without dead ends: 393 [2022-04-28 15:30:20,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:20,200 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 134 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:20,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 416 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 15:30:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-28 15:30:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 325. [2022-04-28 15:30:20,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:20,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 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-28 15:30:20,230 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 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-28 15:30:20,230 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 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-28 15:30:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:20,236 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-28 15:30:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-28 15:30:20,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:20,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:20,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 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 393 states. [2022-04-28 15:30:20,237 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 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 393 states. [2022-04-28 15:30:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:20,244 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-28 15:30:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-28 15:30:20,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:20,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:20,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:20,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 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-28 15:30:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2022-04-28 15:30:20,249 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 106 [2022-04-28 15:30:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:20,250 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2022-04-28 15:30:20,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:20,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 488 transitions. [2022-04-28 15:30:20,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2022-04-28 15:30:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 15:30:20,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:20,649 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-28 15:30:20,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:30:20,649 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 1 times [2022-04-28 15:30:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:20,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1565337935] [2022-04-28 15:30:20,706 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:20,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 2 times [2022-04-28 15:30:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:20,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173295231] [2022-04-28 15:30:20,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:20,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:20,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {48342#(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(196, 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); {48335#true} is VALID [2022-04-28 15:30:20,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-28 15:30:20,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48335#true} {48335#true} #690#return; {48335#true} is VALID [2022-04-28 15:30:20,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {48335#true} call ULTIMATE.init(); {48342#(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-28 15:30:20,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {48342#(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(196, 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); {48335#true} is VALID [2022-04-28 15:30:20,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-28 15:30:20,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48335#true} {48335#true} #690#return; {48335#true} is VALID [2022-04-28 15:30:20,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {48335#true} call #t~ret161 := main(); {48335#true} is VALID [2022-04-28 15:30:20,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {48335#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48335#true} is VALID [2022-04-28 15:30:20,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {48335#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L272 TraceCheckUtils]: 7: Hoare triple {48335#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {48335#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {48335#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {48335#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {48335#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {48335#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {48335#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {48335#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {48335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {48335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {48335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {48335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {48335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {48335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {48335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {48335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {48335#true} assume 8464 == #t~mem55;havoc #t~mem55; {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {48335#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {48335#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {48335#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {48335#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {48335#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {48335#true} ~skip~0 := 0; {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {48335#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {48335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {48335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {48335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {48335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {48335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {48335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {48335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {48335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {48335#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {48335#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 43: Hoare triple {48335#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {48335#true} assume 8496 == #t~mem58;havoc #t~mem58; {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {48335#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {48335#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48335#true} is VALID [2022-04-28 15:30:20,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {48335#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:30:20,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {48335#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,832 INFO L290 TraceCheckUtils]: 54: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,834 INFO L290 TraceCheckUtils]: 59: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,834 INFO L290 TraceCheckUtils]: 60: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,835 INFO L290 TraceCheckUtils]: 62: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,835 INFO L290 TraceCheckUtils]: 63: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,836 INFO L290 TraceCheckUtils]: 66: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,838 INFO L290 TraceCheckUtils]: 70: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,839 INFO L290 TraceCheckUtils]: 73: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,839 INFO L290 TraceCheckUtils]: 74: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:20,839 INFO L290 TraceCheckUtils]: 75: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48341#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 76: Hoare triple {48341#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {48336#false} assume !(~num1~0 > 0); {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 78: Hoare triple {48336#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 79: Hoare triple {48336#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 80: Hoare triple {48336#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 81: Hoare triple {48336#false} ~skip~0 := 0; {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 82: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 83: Hoare triple {48336#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 84: Hoare triple {48336#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 85: Hoare triple {48336#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,840 INFO L290 TraceCheckUtils]: 86: Hoare triple {48336#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 87: Hoare triple {48336#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 88: Hoare triple {48336#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 89: Hoare triple {48336#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 90: Hoare triple {48336#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 91: Hoare triple {48336#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 92: Hoare triple {48336#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 93: Hoare triple {48336#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 94: Hoare triple {48336#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 95: Hoare triple {48336#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 96: Hoare triple {48336#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 97: Hoare triple {48336#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 98: Hoare triple {48336#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 99: Hoare triple {48336#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 100: Hoare triple {48336#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,841 INFO L290 TraceCheckUtils]: 101: Hoare triple {48336#false} assume 8544 == #t~mem64;havoc #t~mem64; {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L290 TraceCheckUtils]: 102: Hoare triple {48336#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L290 TraceCheckUtils]: 103: Hoare triple {48336#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L290 TraceCheckUtils]: 104: Hoare triple {48336#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L290 TraceCheckUtils]: 105: Hoare triple {48336#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L290 TraceCheckUtils]: 106: Hoare triple {48336#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L290 TraceCheckUtils]: 107: Hoare triple {48336#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L290 TraceCheckUtils]: 108: Hoare triple {48336#false} assume 7 == ~blastFlag~0; {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L290 TraceCheckUtils]: 109: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-28 15:30:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:30:20,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:20,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173295231] [2022-04-28 15:30:20,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173295231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:20,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:20,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:20,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:20,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1565337935] [2022-04-28 15:30:20,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1565337935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:20,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:20,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998787623] [2022-04-28 15:30:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:20,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-28 15:30:20,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:20,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:20,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:20,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:20,913 INFO L87 Difference]: Start difference. First operand 325 states and 488 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:27,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:29,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:33,214 INFO L93 Difference]: Finished difference Result 768 states and 1165 transitions. [2022-04-28 15:30:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-28 15:30:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:30:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:30:33,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-28 15:30:33,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:33,571 INFO L225 Difference]: With dead ends: 768 [2022-04-28 15:30:33,572 INFO L226 Difference]: Without dead ends: 469 [2022-04-28 15:30:33,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:33,573 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:33,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 404 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-04-28 15:30:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-28 15:30:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 389. [2022-04-28 15:30:33,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:33,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:33,631 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:33,632 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:33,639 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-28 15:30:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-28 15:30:33,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:33,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:33,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-28 15:30:33,640 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-28 15:30:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:33,648 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-28 15:30:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-28 15:30:33,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:33,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:33,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:33,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 584 transitions. [2022-04-28 15:30:33,656 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 584 transitions. Word has length 110 [2022-04-28 15:30:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:33,657 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 584 transitions. [2022-04-28 15:30:33,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:33,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 584 transitions. [2022-04-28 15:30:34,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 584 transitions. [2022-04-28 15:30:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 15:30:34,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:34,160 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:30:34,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:30:34,160 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash 352037614, now seen corresponding path program 1 times [2022-04-28 15:30:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:34,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2124127706] [2022-04-28 15:30:34,225 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:34,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 352037614, now seen corresponding path program 2 times [2022-04-28 15:30:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:34,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5069767] [2022-04-28 15:30:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:34,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:34,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {51606#(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(196, 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); {51599#true} is VALID [2022-04-28 15:30:34,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-28 15:30:34,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51599#true} {51599#true} #690#return; {51599#true} is VALID [2022-04-28 15:30:34,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {51599#true} call ULTIMATE.init(); {51606#(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-28 15:30:34,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {51606#(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(196, 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); {51599#true} is VALID [2022-04-28 15:30:34,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-28 15:30:34,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51599#true} {51599#true} #690#return; {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {51599#true} call #t~ret161 := main(); {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {51599#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {51599#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L272 TraceCheckUtils]: 7: Hoare triple {51599#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {51599#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {51599#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {51599#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {51599#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {51599#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {51599#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {51599#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {51599#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {51599#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {51599#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {51599#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {51599#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {51599#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {51599#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {51599#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {51599#true} assume 8464 == #t~mem55;havoc #t~mem55; {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {51599#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {51599#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {51599#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {51599#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {51599#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {51599#true} ~skip~0 := 0; {51599#true} is VALID [2022-04-28 15:30:34,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {51599#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {51599#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {51599#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {51599#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {51599#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {51599#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {51599#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {51599#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {51599#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {51599#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {51599#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {51599#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {51599#true} assume 8496 == #t~mem58;havoc #t~mem58; {51599#true} is VALID [2022-04-28 15:30:34,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {51599#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {51599#true} is VALID [2022-04-28 15:30:34,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {51599#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51599#true} is VALID [2022-04-28 15:30:34,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {51599#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:30:34,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {51599#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} ~skip~0 := 0; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !false; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,344 INFO L290 TraceCheckUtils]: 62: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,345 INFO L290 TraceCheckUtils]: 64: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,345 INFO L290 TraceCheckUtils]: 65: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,345 INFO L290 TraceCheckUtils]: 66: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,346 INFO L290 TraceCheckUtils]: 67: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,347 INFO L290 TraceCheckUtils]: 71: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,347 INFO L290 TraceCheckUtils]: 72: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,348 INFO L290 TraceCheckUtils]: 73: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,348 INFO L290 TraceCheckUtils]: 74: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,348 INFO L290 TraceCheckUtils]: 75: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,349 INFO L290 TraceCheckUtils]: 78: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,350 INFO L290 TraceCheckUtils]: 79: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:30:34,350 INFO L290 TraceCheckUtils]: 80: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51605#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-28 15:30:34,350 INFO L290 TraceCheckUtils]: 81: Hoare triple {51605#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {51600#false} is VALID [2022-04-28 15:30:34,350 INFO L290 TraceCheckUtils]: 82: Hoare triple {51600#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {51600#false} is VALID [2022-04-28 15:30:34,350 INFO L290 TraceCheckUtils]: 83: Hoare triple {51600#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 84: Hoare triple {51600#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 85: Hoare triple {51600#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {51600#false} ~skip~0 := 0; {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 87: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 88: Hoare triple {51600#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 89: Hoare triple {51600#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 90: Hoare triple {51600#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 91: Hoare triple {51600#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 92: Hoare triple {51600#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 93: Hoare triple {51600#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 94: Hoare triple {51600#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 95: Hoare triple {51600#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 96: Hoare triple {51600#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,351 INFO L290 TraceCheckUtils]: 97: Hoare triple {51600#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,352 INFO L290 TraceCheckUtils]: 98: Hoare triple {51600#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,352 INFO L290 TraceCheckUtils]: 99: Hoare triple {51600#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,352 INFO L290 TraceCheckUtils]: 100: Hoare triple {51600#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,352 INFO L290 TraceCheckUtils]: 101: Hoare triple {51600#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 102: Hoare triple {51600#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 103: Hoare triple {51600#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 104: Hoare triple {51600#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 105: Hoare triple {51600#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 106: Hoare triple {51600#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 107: Hoare triple {51600#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 108: Hoare triple {51600#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 109: Hoare triple {51600#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 110: Hoare triple {51600#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 111: Hoare triple {51600#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 112: Hoare triple {51600#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 113: Hoare triple {51600#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 114: Hoare triple {51600#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 115: Hoare triple {51600#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 116: Hoare triple {51600#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 117: Hoare triple {51600#false} assume 8640 == #t~mem75;havoc #t~mem75; {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 118: Hoare triple {51600#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 119: Hoare triple {51600#false} assume !(4 == ~blastFlag~0); {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 120: Hoare triple {51600#false} assume 5 == ~blastFlag~0; {51600#false} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 121: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-28 15:30:34,375 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-28 15:30:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:34,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5069767] [2022-04-28 15:30:34,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5069767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:34,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:34,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:34,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:34,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2124127706] [2022-04-28 15:30:34,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2124127706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:34,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:34,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:34,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921146024] [2022-04-28 15:30:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:34,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-28 15:30:34,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:34,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:34,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:34,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:34,454 INFO L87 Difference]: Start difference. First operand 389 states and 584 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:39,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:41,407 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-28 15:30:43,428 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-28 15:30:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:44,603 INFO L93 Difference]: Finished difference Result 860 states and 1297 transitions. [2022-04-28 15:30:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:44,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-28 15:30:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:30:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:30:44,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-28 15:30:44,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:44,991 INFO L225 Difference]: With dead ends: 860 [2022-04-28 15:30:44,991 INFO L226 Difference]: Without dead ends: 497 [2022-04-28 15:30:44,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:44,992 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 111 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:44,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 394 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 477 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-28 15:30:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-28 15:30:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 426. [2022-04-28 15:30:45,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:45,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:45,013 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:45,013 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:45,022 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-28 15:30:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-28 15:30:45,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:45,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:45,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-28 15:30:45,024 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-28 15:30:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:45,032 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-28 15:30:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-28 15:30:45,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:45,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:45,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:45,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 640 transitions. [2022-04-28 15:30:45,041 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 640 transitions. Word has length 122 [2022-04-28 15:30:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:45,042 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 640 transitions. [2022-04-28 15:30:45,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:45,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 640 transitions. [2022-04-28 15:30:45,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 640 transitions. [2022-04-28 15:30:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:30:45,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:45,649 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:30:45,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:30:45,649 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782150, now seen corresponding path program 1 times [2022-04-28 15:30:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:45,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494392037] [2022-04-28 15:30:45,718 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:45,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782150, now seen corresponding path program 2 times [2022-04-28 15:30:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:45,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500654756] [2022-04-28 15:30:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:45,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {55184#(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(196, 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); {55177#true} is VALID [2022-04-28 15:30:45,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-28 15:30:45,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55177#true} {55177#true} #690#return; {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {55177#true} call ULTIMATE.init(); {55184#(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-28 15:30:45,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {55184#(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(196, 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); {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55177#true} {55177#true} #690#return; {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {55177#true} call #t~ret161 := main(); {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {55177#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {55177#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L272 TraceCheckUtils]: 7: Hoare triple {55177#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {55177#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {55177#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {55177#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {55177#true} is VALID [2022-04-28 15:30:45,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {55177#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {55177#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {55177#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {55177#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {55177#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {55177#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {55177#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {55177#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {55177#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {55177#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {55177#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {55177#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {55177#true} assume 8464 == #t~mem55;havoc #t~mem55; {55177#true} is VALID [2022-04-28 15:30:45,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {55177#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {55177#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {55177#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {55177#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {55177#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {55177#true} ~skip~0 := 0; {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {55177#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {55177#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {55177#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {55177#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {55177#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {55177#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {55177#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {55177#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {55177#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {55177#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {55177#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {55177#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {55177#true} assume 8496 == #t~mem58;havoc #t~mem58; {55177#true} is VALID [2022-04-28 15:30:45,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {55177#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {55177#true} is VALID [2022-04-28 15:30:45,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {55177#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55177#true} is VALID [2022-04-28 15:30:45,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {55177#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:45,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {55177#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} ~skip~0 := 0; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !false; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:45,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55183#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-28 15:30:45,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {55183#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {55178#false} is VALID [2022-04-28 15:30:45,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {55178#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {55178#false} is VALID [2022-04-28 15:30:45,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {55178#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,858 INFO L290 TraceCheckUtils]: 64: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-28 15:30:45,858 INFO L290 TraceCheckUtils]: 65: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 68: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 69: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 70: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 71: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {55178#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {55178#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {55178#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {55178#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {55178#false} assume 8448 == #t~mem68;havoc #t~mem68; {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 90: Hoare triple {55178#false} assume !(~num1~0 > 0); {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 91: Hoare triple {55178#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {55178#false} is VALID [2022-04-28 15:30:45,860 INFO L290 TraceCheckUtils]: 92: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 93: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 95: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 96: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 97: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 98: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 99: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 100: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 101: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 102: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 103: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 104: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 105: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,861 INFO L290 TraceCheckUtils]: 106: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 107: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 108: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 109: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 110: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 111: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 112: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 113: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 114: Hoare triple {55178#false} assume 8544 == #t~mem64;havoc #t~mem64; {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 115: Hoare triple {55178#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 116: Hoare triple {55178#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 117: Hoare triple {55178#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 118: Hoare triple {55178#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 119: Hoare triple {55178#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {55178#false} is VALID [2022-04-28 15:30:45,862 INFO L290 TraceCheckUtils]: 120: Hoare triple {55178#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {55178#false} is VALID [2022-04-28 15:30:45,863 INFO L290 TraceCheckUtils]: 121: Hoare triple {55178#false} assume 7 == ~blastFlag~0; {55178#false} is VALID [2022-04-28 15:30:45,863 INFO L290 TraceCheckUtils]: 122: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-28 15:30:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 15:30:45,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:45,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500654756] [2022-04-28 15:30:45,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500654756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:45,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:45,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:45,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:45,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494392037] [2022-04-28 15:30:45,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494392037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:45,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:45,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973907600] [2022-04-28 15:30:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:30:45,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:45,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:45,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:45,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:45,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:45,950 INFO L87 Difference]: Start difference. First operand 426 states and 640 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:50,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:56,105 INFO L93 Difference]: Finished difference Result 892 states and 1345 transitions. [2022-04-28 15:30:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:56,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:30:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 15:30:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 15:30:56,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-28 15:30:56,455 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-28 15:30:56,465 INFO L225 Difference]: With dead ends: 892 [2022-04-28 15:30:56,465 INFO L226 Difference]: Without dead ends: 492 [2022-04-28 15:30:56,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:56,466 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 132 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:56,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 362 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 15:30:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-28 15:30:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 426. [2022-04-28 15:30:56,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:56,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,510 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,510 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:56,519 INFO L93 Difference]: Finished difference Result 492 states and 728 transitions. [2022-04-28 15:30:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 728 transitions. [2022-04-28 15:30:56,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:56,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:56,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 15:30:56,520 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 15:30:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:56,539 INFO L93 Difference]: Finished difference Result 492 states and 728 transitions. [2022-04-28 15:30:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 728 transitions. [2022-04-28 15:30:56,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:56,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:56,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:56,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2022-04-28 15:30:56,549 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 123 [2022-04-28 15:30:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:56,549 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2022-04-28 15:30:56,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 633 transitions. [2022-04-28 15:30:57,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2022-04-28 15:30:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:30:57,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:57,150 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:30:57,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:30:57,150 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:57,151 INFO L85 PathProgramCache]: Analyzing trace with hash 988315678, now seen corresponding path program 1 times [2022-04-28 15:30:57,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:57,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1440835028] [2022-04-28 15:30:57,213 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:57,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash 988315678, now seen corresponding path program 2 times [2022-04-28 15:30:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:57,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794974621] [2022-04-28 15:30:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:57,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {58816#(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(196, 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); {58809#true} is VALID [2022-04-28 15:30:57,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {58809#true} assume true; {58809#true} is VALID [2022-04-28 15:30:57,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58809#true} {58809#true} #690#return; {58809#true} is VALID [2022-04-28 15:30:57,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {58809#true} call ULTIMATE.init(); {58816#(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-28 15:30:57,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {58816#(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(196, 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); {58809#true} is VALID [2022-04-28 15:30:57,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {58809#true} assume true; {58809#true} is VALID [2022-04-28 15:30:57,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58809#true} {58809#true} #690#return; {58809#true} is VALID [2022-04-28 15:30:57,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {58809#true} call #t~ret161 := main(); {58809#true} is VALID [2022-04-28 15:30:57,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {58809#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {58809#true} is VALID [2022-04-28 15:30:57,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {58809#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {58809#true} is VALID [2022-04-28 15:30:57,312 INFO L272 TraceCheckUtils]: 7: Hoare triple {58809#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {58809#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {58809#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {58809#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {58809#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {58809#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {58809#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {58809#true} assume !false; {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {58809#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {58809#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {58809#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {58809#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {58809#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {58809#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {58809#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {58809#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {58809#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {58809#true} assume 8464 == #t~mem55;havoc #t~mem55; {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {58809#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {58809#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {58809#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {58809#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {58809#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {58809#true} ~skip~0 := 0; {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {58809#true} assume !false; {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {58809#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {58809#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {58809#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {58809#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {58809#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {58809#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {58809#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {58809#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {58809#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {58809#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {58809#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {58809#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {58809#true} assume 8496 == #t~mem58;havoc #t~mem58; {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {58809#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {58809#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58809#true} is VALID [2022-04-28 15:30:57,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {58809#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:30:57,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {58809#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,322 INFO L290 TraceCheckUtils]: 67: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,324 INFO L290 TraceCheckUtils]: 71: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,324 INFO L290 TraceCheckUtils]: 72: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,324 INFO L290 TraceCheckUtils]: 73: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,325 INFO L290 TraceCheckUtils]: 75: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,326 INFO L290 TraceCheckUtils]: 79: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,327 INFO L290 TraceCheckUtils]: 80: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,327 INFO L290 TraceCheckUtils]: 81: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {58815#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-28 15:30:57,327 INFO L290 TraceCheckUtils]: 82: Hoare triple {58815#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {58810#false} is VALID [2022-04-28 15:30:57,327 INFO L290 TraceCheckUtils]: 83: Hoare triple {58810#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {58810#false} is VALID [2022-04-28 15:30:57,327 INFO L290 TraceCheckUtils]: 84: Hoare triple {58810#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,327 INFO L290 TraceCheckUtils]: 85: Hoare triple {58810#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,327 INFO L290 TraceCheckUtils]: 86: Hoare triple {58810#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58810#false} is VALID [2022-04-28 15:30:57,328 INFO L290 TraceCheckUtils]: 87: Hoare triple {58810#false} ~skip~0 := 0; {58810#false} is VALID [2022-04-28 15:30:57,328 INFO L290 TraceCheckUtils]: 88: Hoare triple {58810#false} assume !false; {58810#false} is VALID [2022-04-28 15:30:57,328 INFO L290 TraceCheckUtils]: 89: Hoare triple {58810#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 90: Hoare triple {58810#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {58810#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {58810#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {58810#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 94: Hoare triple {58810#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 95: Hoare triple {58810#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 96: Hoare triple {58810#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 97: Hoare triple {58810#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,339 INFO L290 TraceCheckUtils]: 98: Hoare triple {58810#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 99: Hoare triple {58810#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 100: Hoare triple {58810#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 101: Hoare triple {58810#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 102: Hoare triple {58810#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 103: Hoare triple {58810#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 104: Hoare triple {58810#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 105: Hoare triple {58810#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 106: Hoare triple {58810#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 107: Hoare triple {58810#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 108: Hoare triple {58810#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 109: Hoare triple {58810#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 110: Hoare triple {58810#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 111: Hoare triple {58810#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,340 INFO L290 TraceCheckUtils]: 112: Hoare triple {58810#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 113: Hoare triple {58810#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 114: Hoare triple {58810#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 115: Hoare triple {58810#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 116: Hoare triple {58810#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 117: Hoare triple {58810#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 118: Hoare triple {58810#false} assume 8640 == #t~mem75;havoc #t~mem75; {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 119: Hoare triple {58810#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 120: Hoare triple {58810#false} assume !(4 == ~blastFlag~0); {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 121: Hoare triple {58810#false} assume 5 == ~blastFlag~0; {58810#false} is VALID [2022-04-28 15:30:57,341 INFO L290 TraceCheckUtils]: 122: Hoare triple {58810#false} assume !false; {58810#false} is VALID [2022-04-28 15:30:57,342 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-28 15:30:57,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:57,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794974621] [2022-04-28 15:30:57,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794974621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:57,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:57,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:57,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:57,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1440835028] [2022-04-28 15:30:57,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1440835028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:57,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:57,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362521021] [2022-04-28 15:30:57,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:57,343 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 123 [2022-04-28 15:30:57,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:57,343 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-28 15:30:57,419 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-28 15:30:57,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:57,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:57,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:57,420 INFO L87 Difference]: Start difference. First operand 426 states and 633 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-28 15:30:59,109 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-28 15:31:02,204 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-28 15:31:04,088 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-28 15:31:05,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:06,899 INFO L93 Difference]: Finished difference Result 897 states and 1337 transitions. [2022-04-28 15:31:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:06,899 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 123 [2022-04-28 15:31:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:06,900 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-28 15:31:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-28 15:31:06,901 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-28 15:31:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-28 15:31:06,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 512 transitions. [2022-04-28 15:31:07,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:07,245 INFO L225 Difference]: With dead ends: 897 [2022-04-28 15:31:07,245 INFO L226 Difference]: Without dead ends: 497 [2022-04-28 15:31:07,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:31:07,246 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 53 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:07,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 513 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 15:31:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-28 15:31:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 466. [2022-04-28 15:31:07,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:07,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:07,306 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:07,306 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:07,337 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-04-28 15:31:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-04-28 15:31:07,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:07,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:07,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-28 15:31:07,339 INFO L87 Difference]: Start difference. First operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-28 15:31:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:07,347 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-04-28 15:31:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-04-28 15:31:07,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:07,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:07,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:07,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 692 transitions. [2022-04-28 15:31:07,371 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 692 transitions. Word has length 123 [2022-04-28 15:31:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:07,371 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 692 transitions. [2022-04-28 15:31:07,371 INFO L496 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-28 15:31:07,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 466 states and 692 transitions. [2022-04-28 15:31:07,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 692 edges. 692 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 692 transitions. [2022-04-28 15:31:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:31:07,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:07,967 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:31:07,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:31:07,967 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:07,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1572547168, now seen corresponding path program 1 times [2022-04-28 15:31:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:07,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722355826] [2022-04-28 15:31:08,035 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:08,035 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1572547168, now seen corresponding path program 2 times [2022-04-28 15:31:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:08,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52532066] [2022-04-28 15:31:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:08,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {62548#(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(196, 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); {62541#true} is VALID [2022-04-28 15:31:08,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {62541#true} assume true; {62541#true} is VALID [2022-04-28 15:31:08,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62541#true} {62541#true} #690#return; {62541#true} is VALID [2022-04-28 15:31:08,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {62541#true} call ULTIMATE.init(); {62548#(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-28 15:31:08,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {62548#(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(196, 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); {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {62541#true} assume true; {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62541#true} {62541#true} #690#return; {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {62541#true} call #t~ret161 := main(); {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {62541#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {62541#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L272 TraceCheckUtils]: 7: Hoare triple {62541#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {62541#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {62541#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {62541#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {62541#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {62541#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {62541#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {62541#true} is VALID [2022-04-28 15:31:08,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {62541#true} assume !false; {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {62541#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {62541#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {62541#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {62541#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {62541#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {62541#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {62541#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {62541#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {62541#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {62541#true} assume 8464 == #t~mem55;havoc #t~mem55; {62541#true} is VALID [2022-04-28 15:31:08,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {62541#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {62541#true} is VALID [2022-04-28 15:31:08,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {62541#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {62541#true} is VALID [2022-04-28 15:31:08,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {62541#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {62541#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {62541#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {62541#true} ~skip~0 := 0; {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {62541#true} assume !false; {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {62541#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {62541#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {62541#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {62541#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {62541#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {62541#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {62541#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {62541#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {62541#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {62541#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {62541#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {62541#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {62541#true} assume 8496 == #t~mem58;havoc #t~mem58; {62541#true} is VALID [2022-04-28 15:31:08,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {62541#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {62541#true} is VALID [2022-04-28 15:31:08,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {62541#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {62541#true} is VALID [2022-04-28 15:31:08,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {62541#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:31:08,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {62541#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} ~skip~0 := 0; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !false; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:08,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62547#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-28 15:31:08,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {62547#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {62542#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {62542#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {62542#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {62542#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {62542#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {62542#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {62542#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 76: Hoare triple {62542#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 77: Hoare triple {62542#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {62542#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {62542#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {62542#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {62542#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {62542#false} assume 8609 == #t~mem74;havoc #t~mem74; {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {62542#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 84: Hoare triple {62542#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 85: Hoare triple {62542#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 86: Hoare triple {62542#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62542#false} is VALID [2022-04-28 15:31:08,183 INFO L290 TraceCheckUtils]: 87: Hoare triple {62542#false} ~skip~0 := 0; {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 88: Hoare triple {62542#false} assume !false; {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 89: Hoare triple {62542#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 90: Hoare triple {62542#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 91: Hoare triple {62542#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 92: Hoare triple {62542#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 93: Hoare triple {62542#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 94: Hoare triple {62542#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 95: Hoare triple {62542#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 96: Hoare triple {62542#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 97: Hoare triple {62542#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 98: Hoare triple {62542#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 99: Hoare triple {62542#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 100: Hoare triple {62542#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 101: Hoare triple {62542#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,184 INFO L290 TraceCheckUtils]: 102: Hoare triple {62542#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 103: Hoare triple {62542#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 104: Hoare triple {62542#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {62542#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 106: Hoare triple {62542#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 107: Hoare triple {62542#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 108: Hoare triple {62542#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 109: Hoare triple {62542#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 110: Hoare triple {62542#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 111: Hoare triple {62542#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 112: Hoare triple {62542#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 113: Hoare triple {62542#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 114: Hoare triple {62542#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 115: Hoare triple {62542#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,185 INFO L290 TraceCheckUtils]: 116: Hoare triple {62542#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,186 INFO L290 TraceCheckUtils]: 117: Hoare triple {62542#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:31:08,186 INFO L290 TraceCheckUtils]: 118: Hoare triple {62542#false} assume 8640 == #t~mem75;havoc #t~mem75; {62542#false} is VALID [2022-04-28 15:31:08,186 INFO L290 TraceCheckUtils]: 119: Hoare triple {62542#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {62542#false} is VALID [2022-04-28 15:31:08,186 INFO L290 TraceCheckUtils]: 120: Hoare triple {62542#false} assume !(4 == ~blastFlag~0); {62542#false} is VALID [2022-04-28 15:31:08,186 INFO L290 TraceCheckUtils]: 121: Hoare triple {62542#false} assume 5 == ~blastFlag~0; {62542#false} is VALID [2022-04-28 15:31:08,186 INFO L290 TraceCheckUtils]: 122: Hoare triple {62542#false} assume !false; {62542#false} is VALID [2022-04-28 15:31:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 15:31:08,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:08,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52532066] [2022-04-28 15:31:08,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52532066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:08,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:08,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:08,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:08,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722355826] [2022-04-28 15:31:08,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722355826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:08,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:08,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:08,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116965678] [2022-04-28 15:31:08,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:08,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:31:08,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:08,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:08,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:08,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:08,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:08,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:08,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:08,250 INFO L87 Difference]: Start difference. First operand 466 states and 692 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:16,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:17,889 INFO L93 Difference]: Finished difference Result 943 states and 1408 transitions. [2022-04-28 15:31:17,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:17,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:31:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:31:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:31:17,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 15:31:18,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:18,188 INFO L225 Difference]: With dead ends: 943 [2022-04-28 15:31:18,188 INFO L226 Difference]: Without dead ends: 503 [2022-04-28 15:31:18,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:31:18,192 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 28 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:18,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 589 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 15:31:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-04-28 15:31:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 490. [2022-04-28 15:31:18,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:18,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:18,220 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:18,221 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:18,229 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2022-04-28 15:31:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 745 transitions. [2022-04-28 15:31:18,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:18,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:18,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-28 15:31:18,230 INFO L87 Difference]: Start difference. First operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-28 15:31:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:18,239 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2022-04-28 15:31:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 745 transitions. [2022-04-28 15:31:18,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:18,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:18,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:18,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 727 transitions. [2022-04-28 15:31:18,250 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 727 transitions. Word has length 123 [2022-04-28 15:31:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:18,250 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 727 transitions. [2022-04-28 15:31:18,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:18,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 490 states and 727 transitions. [2022-04-28 15:31:18,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 727 transitions. [2022-04-28 15:31:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:31:18,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:18,908 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:18,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:31:18,908 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 1 times [2022-04-28 15:31:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:18,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886483295] [2022-04-28 15:31:19,003 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:19,003 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 2 times [2022-04-28 15:31:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:19,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260878141] [2022-04-28 15:31:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:19,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {66432#(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(196, 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); {66425#true} is VALID [2022-04-28 15:31:19,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {66425#true} assume true; {66425#true} is VALID [2022-04-28 15:31:19,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66425#true} {66425#true} #690#return; {66425#true} is VALID [2022-04-28 15:31:19,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {66425#true} call ULTIMATE.init(); {66432#(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-28 15:31:19,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {66432#(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(196, 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); {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {66425#true} assume true; {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66425#true} {66425#true} #690#return; {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {66425#true} call #t~ret161 := main(); {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {66425#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {66425#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L272 TraceCheckUtils]: 7: Hoare triple {66425#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {66425#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {66425#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {66425#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {66425#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {66425#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {66425#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {66425#true} is VALID [2022-04-28 15:31:19,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {66425#true} assume !false; {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {66425#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {66425#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {66425#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {66425#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {66425#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {66425#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {66425#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {66425#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {66425#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {66425#true} assume 8464 == #t~mem55;havoc #t~mem55; {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {66425#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {66425#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {66425#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {66425#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {66425#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {66425#true} ~skip~0 := 0; {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {66425#true} assume !false; {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {66425#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {66425#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {66425#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {66425#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {66425#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {66425#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {66425#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {66425#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {66425#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {66425#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {66425#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {66425#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {66425#true} assume 8496 == #t~mem58;havoc #t~mem58; {66425#true} is VALID [2022-04-28 15:31:19,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {66425#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {66425#true} is VALID [2022-04-28 15:31:19,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {66425#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66425#true} is VALID [2022-04-28 15:31:19,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {66425#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:31:19,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {66425#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,123 INFO L290 TraceCheckUtils]: 54: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,123 INFO L290 TraceCheckUtils]: 55: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,123 INFO L290 TraceCheckUtils]: 56: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,124 INFO L290 TraceCheckUtils]: 57: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,124 INFO L290 TraceCheckUtils]: 58: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,124 INFO L290 TraceCheckUtils]: 59: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,125 INFO L290 TraceCheckUtils]: 61: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,125 INFO L290 TraceCheckUtils]: 62: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,126 INFO L290 TraceCheckUtils]: 63: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:19,127 INFO L290 TraceCheckUtils]: 67: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66431#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-28 15:31:19,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {66431#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {66426#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {66426#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {66426#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {66426#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {66426#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {66426#false} ~skip~0 := 0; {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 75: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 76: Hoare triple {66426#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 77: Hoare triple {66426#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 78: Hoare triple {66426#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 79: Hoare triple {66426#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 80: Hoare triple {66426#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 81: Hoare triple {66426#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,128 INFO L290 TraceCheckUtils]: 82: Hoare triple {66426#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 83: Hoare triple {66426#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 84: Hoare triple {66426#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 85: Hoare triple {66426#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 86: Hoare triple {66426#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 87: Hoare triple {66426#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 88: Hoare triple {66426#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 89: Hoare triple {66426#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 90: Hoare triple {66426#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 91: Hoare triple {66426#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 92: Hoare triple {66426#false} assume 8528 == #t~mem62;havoc #t~mem62; {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 93: Hoare triple {66426#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 94: Hoare triple {66426#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 95: Hoare triple {66426#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,129 INFO L290 TraceCheckUtils]: 96: Hoare triple {66426#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 97: Hoare triple {66426#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 98: Hoare triple {66426#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 99: Hoare triple {66426#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 100: Hoare triple {66426#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 101: Hoare triple {66426#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 102: Hoare triple {66426#false} ~skip~0 := 0; {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 103: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 104: Hoare triple {66426#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 105: Hoare triple {66426#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 106: Hoare triple {66426#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 107: Hoare triple {66426#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 108: Hoare triple {66426#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 109: Hoare triple {66426#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,130 INFO L290 TraceCheckUtils]: 110: Hoare triple {66426#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 111: Hoare triple {66426#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 112: Hoare triple {66426#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 113: Hoare triple {66426#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 114: Hoare triple {66426#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 115: Hoare triple {66426#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 116: Hoare triple {66426#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 117: Hoare triple {66426#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 118: Hoare triple {66426#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 119: Hoare triple {66426#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 120: Hoare triple {66426#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 121: Hoare triple {66426#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 122: Hoare triple {66426#false} assume 8544 == #t~mem64;havoc #t~mem64; {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 123: Hoare triple {66426#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 124: Hoare triple {66426#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {66426#false} is VALID [2022-04-28 15:31:19,131 INFO L290 TraceCheckUtils]: 125: Hoare triple {66426#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {66426#false} is VALID [2022-04-28 15:31:19,132 INFO L290 TraceCheckUtils]: 126: Hoare triple {66426#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {66426#false} is VALID [2022-04-28 15:31:19,132 INFO L290 TraceCheckUtils]: 127: Hoare triple {66426#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {66426#false} is VALID [2022-04-28 15:31:19,132 INFO L290 TraceCheckUtils]: 128: Hoare triple {66426#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {66426#false} is VALID [2022-04-28 15:31:19,132 INFO L290 TraceCheckUtils]: 129: Hoare triple {66426#false} assume 7 == ~blastFlag~0; {66426#false} is VALID [2022-04-28 15:31:19,132 INFO L290 TraceCheckUtils]: 130: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-28 15:31:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 15:31:19,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:19,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260878141] [2022-04-28 15:31:19,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260878141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:19,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:19,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:19,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:19,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886483295] [2022-04-28 15:31:19,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886483295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:19,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:19,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039757585] [2022-04-28 15:31:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:19,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:19,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:19,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:19,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:19,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:19,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:19,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:19,202 INFO L87 Difference]: Start difference. First operand 490 states and 727 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:21,475 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-28 15:31:25,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:27,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:28,604 INFO L93 Difference]: Finished difference Result 985 states and 1465 transitions. [2022-04-28 15:31:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:28,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2022-04-28 15:31:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2022-04-28 15:31:28,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 511 transitions. [2022-04-28 15:31:28,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:28,908 INFO L225 Difference]: With dead ends: 985 [2022-04-28 15:31:28,908 INFO L226 Difference]: Without dead ends: 521 [2022-04-28 15:31:28,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:31:28,909 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 66 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:28,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 527 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 15:31:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-04-28 15:31:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 490. [2022-04-28 15:31:28,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:28,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 521 states. Second operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:28,962 INFO L74 IsIncluded]: Start isIncluded. First operand 521 states. Second operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:28,963 INFO L87 Difference]: Start difference. First operand 521 states. Second operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:28,971 INFO L93 Difference]: Finished difference Result 521 states and 767 transitions. [2022-04-28 15:31:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 767 transitions. [2022-04-28 15:31:28,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:28,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:28,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-28 15:31:28,973 INFO L87 Difference]: Start difference. First operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-28 15:31:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:28,989 INFO L93 Difference]: Finished difference Result 521 states and 767 transitions. [2022-04-28 15:31:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 767 transitions. [2022-04-28 15:31:28,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:28,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:28,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:28,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 726 transitions. [2022-04-28 15:31:29,000 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 726 transitions. Word has length 131 [2022-04-28 15:31:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:29,000 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 726 transitions. [2022-04-28 15:31:29,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:29,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 490 states and 726 transitions. [2022-04-28 15:31:29,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 726 transitions. [2022-04-28 15:31:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:31:29,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:29,664 INFO L195 NwaCegarLoop]: 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] [2022-04-28 15:31:29,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:31:29,664 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1134050048, now seen corresponding path program 1 times [2022-04-28 15:31:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:29,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1861312480] [2022-04-28 15:31:29,748 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:29,748 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1134050048, now seen corresponding path program 2 times [2022-04-28 15:31:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:29,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056090119] [2022-04-28 15:31:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:29,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:29,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {70436#(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(196, 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); {70429#true} is VALID [2022-04-28 15:31:29,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {70429#true} assume true; {70429#true} is VALID [2022-04-28 15:31:29,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70429#true} {70429#true} #690#return; {70429#true} is VALID [2022-04-28 15:31:29,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {70429#true} call ULTIMATE.init(); {70436#(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-28 15:31:29,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {70436#(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(196, 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); {70429#true} is VALID [2022-04-28 15:31:29,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {70429#true} assume true; {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70429#true} {70429#true} #690#return; {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {70429#true} call #t~ret161 := main(); {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {70429#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {70429#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L272 TraceCheckUtils]: 7: Hoare triple {70429#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {70429#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {70429#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {70429#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {70429#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {70429#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {70429#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {70429#true} assume !false; {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {70429#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {70429#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {70429#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {70429#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {70429#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {70429#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {70429#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {70429#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {70429#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {70429#true} assume 8464 == #t~mem55;havoc #t~mem55; {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {70429#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {70429#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {70429#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {70429#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {70429#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {70429#true} ~skip~0 := 0; {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {70429#true} assume !false; {70429#true} is VALID [2022-04-28 15:31:29,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {70429#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {70429#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {70429#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {70429#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {70429#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {70429#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {70429#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {70429#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {70429#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {70429#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {70429#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {70429#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {70429#true} assume 8496 == #t~mem58;havoc #t~mem58; {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {70429#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 46: Hoare triple {70429#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70429#true} is VALID [2022-04-28 15:31:29,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {70429#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {70429#true} is VALID [2022-04-28 15:31:29,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {70429#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,857 INFO L290 TraceCheckUtils]: 59: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,859 INFO L290 TraceCheckUtils]: 64: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,864 INFO L290 TraceCheckUtils]: 79: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,864 INFO L290 TraceCheckUtils]: 80: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,865 INFO L290 TraceCheckUtils]: 82: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:29,865 INFO L290 TraceCheckUtils]: 84: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {70435#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 85: Hoare triple {70435#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 86: Hoare triple {70430#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 87: Hoare triple {70430#false} assume 8672 == #t~mem79;havoc #t~mem79; {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 88: Hoare triple {70430#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 89: Hoare triple {70430#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 90: Hoare triple {70430#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 91: Hoare triple {70430#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 92: Hoare triple {70430#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 93: Hoare triple {70430#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 94: Hoare triple {70430#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 95: Hoare triple {70430#false} ~skip~0 := 0; {70430#false} is VALID [2022-04-28 15:31:29,866 INFO L290 TraceCheckUtils]: 96: Hoare triple {70430#false} assume !false; {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 97: Hoare triple {70430#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 98: Hoare triple {70430#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 99: Hoare triple {70430#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 100: Hoare triple {70430#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 101: Hoare triple {70430#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 102: Hoare triple {70430#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 103: Hoare triple {70430#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 104: Hoare triple {70430#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 105: Hoare triple {70430#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 106: Hoare triple {70430#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 107: Hoare triple {70430#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 108: Hoare triple {70430#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 109: Hoare triple {70430#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,867 INFO L290 TraceCheckUtils]: 110: Hoare triple {70430#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 111: Hoare triple {70430#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 112: Hoare triple {70430#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 113: Hoare triple {70430#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 114: Hoare triple {70430#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 115: Hoare triple {70430#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 116: Hoare triple {70430#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 117: Hoare triple {70430#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 118: Hoare triple {70430#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 119: Hoare triple {70430#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 120: Hoare triple {70430#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 121: Hoare triple {70430#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 122: Hoare triple {70430#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 123: Hoare triple {70430#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 124: Hoare triple {70430#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,868 INFO L290 TraceCheckUtils]: 125: Hoare triple {70430#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-28 15:31:29,869 INFO L290 TraceCheckUtils]: 126: Hoare triple {70430#false} assume 8640 == #t~mem75;havoc #t~mem75; {70430#false} is VALID [2022-04-28 15:31:29,869 INFO L290 TraceCheckUtils]: 127: Hoare triple {70430#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {70430#false} is VALID [2022-04-28 15:31:29,869 INFO L290 TraceCheckUtils]: 128: Hoare triple {70430#false} assume !(4 == ~blastFlag~0); {70430#false} is VALID [2022-04-28 15:31:29,869 INFO L290 TraceCheckUtils]: 129: Hoare triple {70430#false} assume 5 == ~blastFlag~0; {70430#false} is VALID [2022-04-28 15:31:29,869 INFO L290 TraceCheckUtils]: 130: Hoare triple {70430#false} assume !false; {70430#false} is VALID [2022-04-28 15:31:29,869 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-28 15:31:29,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:29,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056090119] [2022-04-28 15:31:29,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056090119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:29,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:29,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:29,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1861312480] [2022-04-28 15:31:29,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1861312480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:29,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:29,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:29,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682758265] [2022-04-28 15:31:29,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:29,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:29,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:29,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:29,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:29,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:29,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:29,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:29,954 INFO L87 Difference]: Start difference. First operand 490 states and 726 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:31,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:33,051 INFO L93 Difference]: Finished difference Result 979 states and 1454 transitions. [2022-04-28 15:31:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:33,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:31:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:31:33,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-28 15:31:33,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:33,292 INFO L225 Difference]: With dead ends: 979 [2022-04-28 15:31:33,292 INFO L226 Difference]: Without dead ends: 515 [2022-04-28 15:31:33,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:31:33,293 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 40 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:33,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 533 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:31:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-28 15:31:33,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 493. [2022-04-28 15:31:33,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:33,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:33,339 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:33,340 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:33,348 INFO L93 Difference]: Finished difference Result 515 states and 757 transitions. [2022-04-28 15:31:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 757 transitions. [2022-04-28 15:31:33,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:33,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:33,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 15:31:33,351 INFO L87 Difference]: Start difference. First operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 15:31:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:33,359 INFO L93 Difference]: Finished difference Result 515 states and 757 transitions. [2022-04-28 15:31:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 757 transitions. [2022-04-28 15:31:33,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:33,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:33,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:33,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 729 transitions. [2022-04-28 15:31:33,370 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 729 transitions. Word has length 131 [2022-04-28 15:31:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:33,370 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 729 transitions. [2022-04-28 15:31:33,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:33,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 493 states and 729 transitions. [2022-04-28 15:31:33,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 729 transitions. [2022-04-28 15:31:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:31:33,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:33,939 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:33,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:31:33,939 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:33,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 1 times [2022-04-28 15:31:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:33,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466269431] [2022-04-28 15:31:34,040 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:34,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 2 times [2022-04-28 15:31:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:34,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568001927] [2022-04-28 15:31:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:34,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:34,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {74421#(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(196, 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); {74415#true} is VALID [2022-04-28 15:31:34,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {74415#true} assume true; {74415#true} is VALID [2022-04-28 15:31:34,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74415#true} {74415#true} #690#return; {74415#true} is VALID [2022-04-28 15:31:34,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {74415#true} call ULTIMATE.init(); {74421#(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-28 15:31:34,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {74421#(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(196, 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); {74415#true} is VALID [2022-04-28 15:31:34,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {74415#true} assume true; {74415#true} is VALID [2022-04-28 15:31:34,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74415#true} {74415#true} #690#return; {74415#true} is VALID [2022-04-28 15:31:34,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {74415#true} call #t~ret161 := main(); {74415#true} is VALID [2022-04-28 15:31:34,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {74415#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {74415#true} is VALID [2022-04-28 15:31:34,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {74415#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {74415#true} is VALID [2022-04-28 15:31:34,161 INFO L272 TraceCheckUtils]: 7: Hoare triple {74415#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74415#true} is VALID [2022-04-28 15:31:34,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {74415#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {74415#true} is VALID [2022-04-28 15:31:34,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {74415#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {74415#true} is VALID [2022-04-28 15:31:34,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {74415#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {74415#true} is VALID [2022-04-28 15:31:34,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {74415#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74415#true} is VALID [2022-04-28 15:31:34,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {74415#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {74415#true} is VALID [2022-04-28 15:31:34,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {74415#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {74415#true} is VALID [2022-04-28 15:31:34,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {74415#true} assume !false; {74415#true} is VALID [2022-04-28 15:31:34,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {74415#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {74415#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {74415#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {74415#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {74415#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {74415#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {74415#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {74415#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {74415#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {74415#true} assume 8464 == #t~mem55;havoc #t~mem55; {74415#true} is VALID [2022-04-28 15:31:34,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {74415#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {74415#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {74415#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {74415#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {74415#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {74415#true} ~skip~0 := 0; {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {74415#true} assume !false; {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {74415#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {74415#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {74415#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {74415#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {74415#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {74415#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {74415#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {74415#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {74415#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {74415#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {74415#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {74415#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-28 15:31:34,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {74415#true} assume 8496 == #t~mem58;havoc #t~mem58; {74415#true} is VALID [2022-04-28 15:31:34,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {74415#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {74415#true} is VALID [2022-04-28 15:31:34,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {74415#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,171 INFO L290 TraceCheckUtils]: 69: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,171 INFO L290 TraceCheckUtils]: 70: Hoare triple {74420#(= 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))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,172 INFO L290 TraceCheckUtils]: 73: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,172 INFO L290 TraceCheckUtils]: 74: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,173 INFO L290 TraceCheckUtils]: 76: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,173 INFO L290 TraceCheckUtils]: 77: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,174 INFO L290 TraceCheckUtils]: 79: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,174 INFO L290 TraceCheckUtils]: 80: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,174 INFO L290 TraceCheckUtils]: 81: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,174 INFO L290 TraceCheckUtils]: 82: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,175 INFO L290 TraceCheckUtils]: 83: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,175 INFO L290 TraceCheckUtils]: 84: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,175 INFO L290 TraceCheckUtils]: 85: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,175 INFO L290 TraceCheckUtils]: 86: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,176 INFO L290 TraceCheckUtils]: 87: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,176 INFO L290 TraceCheckUtils]: 90: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,177 INFO L290 TraceCheckUtils]: 91: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,177 INFO L290 TraceCheckUtils]: 92: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,177 INFO L290 TraceCheckUtils]: 93: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,177 INFO L290 TraceCheckUtils]: 94: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,178 INFO L290 TraceCheckUtils]: 95: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,178 INFO L290 TraceCheckUtils]: 97: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,178 INFO L290 TraceCheckUtils]: 98: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,179 INFO L290 TraceCheckUtils]: 99: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,179 INFO L290 TraceCheckUtils]: 100: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,179 INFO L290 TraceCheckUtils]: 101: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,179 INFO L290 TraceCheckUtils]: 102: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,180 INFO L290 TraceCheckUtils]: 103: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,180 INFO L290 TraceCheckUtils]: 104: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,180 INFO L290 TraceCheckUtils]: 105: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,180 INFO L290 TraceCheckUtils]: 106: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,181 INFO L290 TraceCheckUtils]: 107: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,181 INFO L290 TraceCheckUtils]: 108: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,181 INFO L290 TraceCheckUtils]: 109: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,181 INFO L290 TraceCheckUtils]: 110: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,182 INFO L290 TraceCheckUtils]: 111: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,182 INFO L290 TraceCheckUtils]: 112: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,182 INFO L290 TraceCheckUtils]: 113: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,182 INFO L290 TraceCheckUtils]: 114: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,183 INFO L290 TraceCheckUtils]: 115: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,183 INFO L290 TraceCheckUtils]: 116: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,183 INFO L290 TraceCheckUtils]: 117: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,183 INFO L290 TraceCheckUtils]: 118: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,184 INFO L290 TraceCheckUtils]: 119: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,184 INFO L290 TraceCheckUtils]: 120: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,184 INFO L290 TraceCheckUtils]: 121: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,184 INFO L290 TraceCheckUtils]: 122: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,185 INFO L290 TraceCheckUtils]: 123: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,185 INFO L290 TraceCheckUtils]: 124: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,185 INFO L290 TraceCheckUtils]: 125: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,185 INFO L290 TraceCheckUtils]: 126: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,186 INFO L290 TraceCheckUtils]: 127: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,186 INFO L290 TraceCheckUtils]: 128: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:34,186 INFO L290 TraceCheckUtils]: 129: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 7 == ~blastFlag~0; {74416#false} is VALID [2022-04-28 15:31:34,186 INFO L290 TraceCheckUtils]: 130: Hoare triple {74416#false} assume !false; {74416#false} is VALID [2022-04-28 15:31:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 15:31:34,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:34,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568001927] [2022-04-28 15:31:34,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568001927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:34,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:34,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:34,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:34,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466269431] [2022-04-28 15:31:34,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466269431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:34,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:34,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532349725] [2022-04-28 15:31:34,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:34,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:34,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:34,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:34,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:31:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:31:34,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:34,251 INFO L87 Difference]: Start difference. First operand 493 states and 729 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:36,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:38,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:40,415 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-28 15:31:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:41,320 INFO L93 Difference]: Finished difference Result 1422 states and 2123 transitions. [2022-04-28 15:31:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:31:41,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-28 15:31:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-28 15:31:41,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 603 transitions. [2022-04-28 15:31:41,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:41,742 INFO L225 Difference]: With dead ends: 1422 [2022-04-28 15:31:41,742 INFO L226 Difference]: Without dead ends: 955 [2022-04-28 15:31:41,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:41,743 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:41,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 435 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 282 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-04-28 15:31:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-04-28 15:31:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-04-28 15:31:41,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:41,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:41,791 INFO L74 IsIncluded]: Start isIncluded. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:41,792 INFO L87 Difference]: Start difference. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:41,816 INFO L93 Difference]: Finished difference Result 955 states and 1414 transitions. [2022-04-28 15:31:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-28 15:31:41,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:41,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:41,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 955 states. [2022-04-28 15:31:41,818 INFO L87 Difference]: Start difference. First operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 955 states. [2022-04-28 15:31:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:41,843 INFO L93 Difference]: Finished difference Result 955 states and 1414 transitions. [2022-04-28 15:31:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-28 15:31:41,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:41,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:41,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:41,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1414 transitions. [2022-04-28 15:31:41,889 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1414 transitions. Word has length 131 [2022-04-28 15:31:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:41,890 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1414 transitions. [2022-04-28 15:31:41,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:41,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 955 states and 1414 transitions. [2022-04-28 15:31:42,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1414 edges. 1414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-28 15:31:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:31:42,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:42,992 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:42,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 15:31:42,992 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 1 times [2022-04-28 15:31:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:42,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [984367561] [2022-04-28 15:31:43,057 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:43,057 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 2 times [2022-04-28 15:31:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:43,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394029787] [2022-04-28 15:31:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:43,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:43,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {81094#(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(196, 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); {81088#true} is VALID [2022-04-28 15:31:43,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {81088#true} assume true; {81088#true} is VALID [2022-04-28 15:31:43,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81088#true} {81088#true} #690#return; {81088#true} is VALID [2022-04-28 15:31:43,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {81088#true} call ULTIMATE.init(); {81094#(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-28 15:31:43,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {81094#(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(196, 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); {81088#true} is VALID [2022-04-28 15:31:43,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {81088#true} assume true; {81088#true} is VALID [2022-04-28 15:31:43,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81088#true} {81088#true} #690#return; {81088#true} is VALID [2022-04-28 15:31:43,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {81088#true} call #t~ret161 := main(); {81088#true} is VALID [2022-04-28 15:31:43,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {81088#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {81088#true} is VALID [2022-04-28 15:31:43,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {81088#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L272 TraceCheckUtils]: 7: Hoare triple {81088#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {81088#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {81088#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {81088#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {81088#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {81088#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {81088#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {81088#true} assume !false; {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {81088#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {81088#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {81088#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {81088#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {81088#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {81088#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {81088#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {81088#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {81088#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-28 15:31:43,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {81088#true} assume 8464 == #t~mem55;havoc #t~mem55; {81088#true} is VALID [2022-04-28 15:31:43,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {81088#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {81088#true} is VALID [2022-04-28 15:31:43,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {81088#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !false; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {81089#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {81089#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {81089#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {81089#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {81089#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 52: Hoare triple {81089#false} ~skip~0 := 0; {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {81089#false} assume !false; {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 54: Hoare triple {81089#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 55: Hoare triple {81089#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {81089#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {81089#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {81089#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {81089#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {81089#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {81089#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 62: Hoare triple {81089#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 63: Hoare triple {81089#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 64: Hoare triple {81089#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 65: Hoare triple {81089#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 66: Hoare triple {81089#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 67: Hoare triple {81089#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,192 INFO L290 TraceCheckUtils]: 68: Hoare triple {81089#false} assume 8512 == #t~mem60;havoc #t~mem60; {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 69: Hoare triple {81089#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 70: Hoare triple {81089#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 71: Hoare triple {81089#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 72: Hoare triple {81089#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 73: Hoare triple {81089#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 74: Hoare triple {81089#false} ~skip~0 := 0; {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 75: Hoare triple {81089#false} assume !false; {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {81089#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {81089#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {81089#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 79: Hoare triple {81089#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {81089#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {81089#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 82: Hoare triple {81089#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 83: Hoare triple {81089#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 84: Hoare triple {81089#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 85: Hoare triple {81089#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 86: Hoare triple {81089#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 87: Hoare triple {81089#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 88: Hoare triple {81089#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 89: Hoare triple {81089#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 90: Hoare triple {81089#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 91: Hoare triple {81089#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,194 INFO L290 TraceCheckUtils]: 92: Hoare triple {81089#false} assume 8528 == #t~mem62;havoc #t~mem62; {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 93: Hoare triple {81089#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 94: Hoare triple {81089#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 95: Hoare triple {81089#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 96: Hoare triple {81089#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 97: Hoare triple {81089#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 98: Hoare triple {81089#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 99: Hoare triple {81089#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 100: Hoare triple {81089#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 101: Hoare triple {81089#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 102: Hoare triple {81089#false} ~skip~0 := 0; {81089#false} is VALID [2022-04-28 15:31:43,195 INFO L290 TraceCheckUtils]: 103: Hoare triple {81089#false} assume !false; {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 104: Hoare triple {81089#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 105: Hoare triple {81089#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 106: Hoare triple {81089#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 107: Hoare triple {81089#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 108: Hoare triple {81089#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 109: Hoare triple {81089#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 110: Hoare triple {81089#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 111: Hoare triple {81089#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 112: Hoare triple {81089#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 113: Hoare triple {81089#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 114: Hoare triple {81089#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 115: Hoare triple {81089#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 116: Hoare triple {81089#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 117: Hoare triple {81089#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,196 INFO L290 TraceCheckUtils]: 118: Hoare triple {81089#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 119: Hoare triple {81089#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 120: Hoare triple {81089#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 121: Hoare triple {81089#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 122: Hoare triple {81089#false} assume 8544 == #t~mem64;havoc #t~mem64; {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 123: Hoare triple {81089#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 124: Hoare triple {81089#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 125: Hoare triple {81089#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 126: Hoare triple {81089#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 127: Hoare triple {81089#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 128: Hoare triple {81089#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 129: Hoare triple {81089#false} assume 7 == ~blastFlag~0; {81089#false} is VALID [2022-04-28 15:31:43,197 INFO L290 TraceCheckUtils]: 130: Hoare triple {81089#false} assume !false; {81089#false} is VALID [2022-04-28 15:31:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-28 15:31:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:43,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394029787] [2022-04-28 15:31:43,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394029787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:43,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:43,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:43,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:43,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [984367561] [2022-04-28 15:31:43,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [984367561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:43,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:43,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425852330] [2022-04-28 15:31:43,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:43,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:43,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:43,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:43,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:43,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:31:43,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:43,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:31:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:43,256 INFO L87 Difference]: Start difference. First operand 955 states and 1414 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:49,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:53,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:54,358 INFO L93 Difference]: Finished difference Result 1911 states and 2835 transitions. [2022-04-28 15:31:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:31:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:31:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:31:54,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-28 15:31:54,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:54,687 INFO L225 Difference]: With dead ends: 1911 [2022-04-28 15:31:54,687 INFO L226 Difference]: Without dead ends: 982 [2022-04-28 15:31:54,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:54,689 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:54,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 15:31:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-04-28 15:31:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2022-04-28 15:31:54,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:54,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:54,740 INFO L74 IsIncluded]: Start isIncluded. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:54,740 INFO L87 Difference]: Start difference. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:54,766 INFO L93 Difference]: Finished difference Result 982 states and 1449 transitions. [2022-04-28 15:31:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-28 15:31:54,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:54,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:54,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-28 15:31:54,769 INFO L87 Difference]: Start difference. First operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-28 15:31:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:54,805 INFO L93 Difference]: Finished difference Result 982 states and 1449 transitions. [2022-04-28 15:31:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-28 15:31:54,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:54,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:54,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:54,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1449 transitions. [2022-04-28 15:31:54,843 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1449 transitions. Word has length 131 [2022-04-28 15:31:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:54,843 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1449 transitions. [2022-04-28 15:31:54,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:54,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 982 states and 1449 transitions. [2022-04-28 15:31:56,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1449 edges. 1449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-28 15:31:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:31:56,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:56,009 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:56,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 15:31:56,009 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 1 times [2022-04-28 15:31:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:56,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310360171] [2022-04-28 15:31:56,095 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:56,095 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 2 times [2022-04-28 15:31:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:56,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190241829] [2022-04-28 15:31:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:56,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {88853#(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(196, 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); {88847#true} is VALID [2022-04-28 15:31:56,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {88847#true} assume true; {88847#true} is VALID [2022-04-28 15:31:56,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88847#true} {88847#true} #690#return; {88847#true} is VALID [2022-04-28 15:31:56,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {88847#true} call ULTIMATE.init(); {88853#(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-28 15:31:56,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {88853#(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(196, 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); {88847#true} is VALID [2022-04-28 15:31:56,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {88847#true} assume true; {88847#true} is VALID [2022-04-28 15:31:56,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88847#true} {88847#true} #690#return; {88847#true} is VALID [2022-04-28 15:31:56,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {88847#true} call #t~ret161 := main(); {88847#true} is VALID [2022-04-28 15:31:56,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {88847#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {88847#true} is VALID [2022-04-28 15:31:56,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {88847#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {88847#true} is VALID [2022-04-28 15:31:56,188 INFO L272 TraceCheckUtils]: 7: Hoare triple {88847#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88847#true} is VALID [2022-04-28 15:31:56,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {88847#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {88852#(= 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)))); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !false; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:56,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {88848#false} is VALID [2022-04-28 15:31:56,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {88848#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {88848#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {88848#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88848#false} is VALID [2022-04-28 15:31:56,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {88848#false} ~skip~0 := 0; {88848#false} is VALID [2022-04-28 15:31:56,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {88848#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {88848#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {88848#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {88848#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {88848#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {88848#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {88848#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {88848#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {88848#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {88848#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {88848#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {88848#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {88848#false} assume 8496 == #t~mem58;havoc #t~mem58; {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 45: Hoare triple {88848#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88848#false} is VALID [2022-04-28 15:31:56,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {88848#false} assume !(1 == ~blastFlag~0); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {88848#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {88848#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {88848#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {88848#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {88848#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {88848#false} ~skip~0 := 0; {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {88848#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {88848#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {88848#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {88848#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {88848#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {88848#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {88848#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {88848#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {88848#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {88848#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {88848#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {88848#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {88848#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 67: Hoare triple {88848#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 68: Hoare triple {88848#false} assume 8512 == #t~mem60;havoc #t~mem60; {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 69: Hoare triple {88848#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 70: Hoare triple {88848#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 71: Hoare triple {88848#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 72: Hoare triple {88848#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 73: Hoare triple {88848#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 74: Hoare triple {88848#false} ~skip~0 := 0; {88848#false} is VALID [2022-04-28 15:31:56,195 INFO L290 TraceCheckUtils]: 75: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {88848#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 77: Hoare triple {88848#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 78: Hoare triple {88848#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 79: Hoare triple {88848#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 80: Hoare triple {88848#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 81: Hoare triple {88848#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 82: Hoare triple {88848#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 83: Hoare triple {88848#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {88848#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {88848#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 86: Hoare triple {88848#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 87: Hoare triple {88848#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 88: Hoare triple {88848#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 89: Hoare triple {88848#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,196 INFO L290 TraceCheckUtils]: 90: Hoare triple {88848#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 91: Hoare triple {88848#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 92: Hoare triple {88848#false} assume 8528 == #t~mem62;havoc #t~mem62; {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 93: Hoare triple {88848#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 94: Hoare triple {88848#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 95: Hoare triple {88848#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 96: Hoare triple {88848#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 97: Hoare triple {88848#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 98: Hoare triple {88848#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 99: Hoare triple {88848#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 100: Hoare triple {88848#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 101: Hoare triple {88848#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 102: Hoare triple {88848#false} ~skip~0 := 0; {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 103: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 104: Hoare triple {88848#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,197 INFO L290 TraceCheckUtils]: 105: Hoare triple {88848#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 106: Hoare triple {88848#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 107: Hoare triple {88848#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 108: Hoare triple {88848#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 109: Hoare triple {88848#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 110: Hoare triple {88848#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 111: Hoare triple {88848#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 112: Hoare triple {88848#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 113: Hoare triple {88848#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 114: Hoare triple {88848#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 115: Hoare triple {88848#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 116: Hoare triple {88848#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 117: Hoare triple {88848#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 118: Hoare triple {88848#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 119: Hoare triple {88848#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,198 INFO L290 TraceCheckUtils]: 120: Hoare triple {88848#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 121: Hoare triple {88848#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 122: Hoare triple {88848#false} assume 8544 == #t~mem64;havoc #t~mem64; {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 123: Hoare triple {88848#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 124: Hoare triple {88848#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 125: Hoare triple {88848#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 126: Hoare triple {88848#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 127: Hoare triple {88848#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 128: Hoare triple {88848#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 129: Hoare triple {88848#false} assume 7 == ~blastFlag~0; {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L290 TraceCheckUtils]: 130: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-28 15:31:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-28 15:31:56,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:56,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190241829] [2022-04-28 15:31:56,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190241829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:56,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:56,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:56,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:56,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310360171] [2022-04-28 15:31:56,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310360171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:56,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:56,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645365889] [2022-04-28 15:31:56,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:56,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:56,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:56,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:56,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:56,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:31:56,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:56,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:31:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:56,255 INFO L87 Difference]: Start difference. First operand 982 states and 1449 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:59,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:01,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:03,064 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-28 15:32:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:03,839 INFO L93 Difference]: Finished difference Result 1940 states and 2871 transitions. [2022-04-28 15:32:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:32:03,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:32:03,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:32:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:32:03,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-28 15:32:04,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:04,069 INFO L225 Difference]: With dead ends: 1940 [2022-04-28 15:32:04,069 INFO L226 Difference]: Without dead ends: 984 [2022-04-28 15:32:04,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:32:04,071 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:04,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:32:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-04-28 15:32:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2022-04-28 15:32:04,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:04,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:04,121 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:04,121 INFO L87 Difference]: Start difference. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:04,147 INFO L93 Difference]: Finished difference Result 984 states and 1451 transitions. [2022-04-28 15:32:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-28 15:32:04,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:04,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:04,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 984 states. [2022-04-28 15:32:04,150 INFO L87 Difference]: Start difference. First operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 984 states. [2022-04-28 15:32:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:04,184 INFO L93 Difference]: Finished difference Result 984 states and 1451 transitions. [2022-04-28 15:32:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-28 15:32:04,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:04,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:04,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:04,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1451 transitions. [2022-04-28 15:32:04,222 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1451 transitions. Word has length 131 [2022-04-28 15:32:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:04,222 INFO L495 AbstractCegarLoop]: Abstraction has 984 states and 1451 transitions. [2022-04-28 15:32:04,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:04,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 984 states and 1451 transitions. [2022-04-28 15:32:05,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1451 edges. 1451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-28 15:32:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 15:32:05,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:05,203 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:32:05,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 15:32:05,203 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 1 times [2022-04-28 15:32:05,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:05,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200031009] [2022-04-28 15:32:05,293 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:05,293 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 2 times [2022-04-28 15:32:05,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:05,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679830425] [2022-04-28 15:32:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:05,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:05,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {96678#(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(196, 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); {96672#true} is VALID [2022-04-28 15:32:05,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {96672#true} assume true; {96672#true} is VALID [2022-04-28 15:32:05,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96672#true} {96672#true} #690#return; {96672#true} is VALID [2022-04-28 15:32:05,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {96672#true} call ULTIMATE.init(); {96678#(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-28 15:32:05,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {96678#(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(196, 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); {96672#true} is VALID [2022-04-28 15:32:05,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {96672#true} assume true; {96672#true} is VALID [2022-04-28 15:32:05,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96672#true} {96672#true} #690#return; {96672#true} is VALID [2022-04-28 15:32:05,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {96672#true} call #t~ret161 := main(); {96672#true} is VALID [2022-04-28 15:32:05,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {96672#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {96672#true} is VALID [2022-04-28 15:32:05,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {96672#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {96672#true} is VALID [2022-04-28 15:32:05,432 INFO L272 TraceCheckUtils]: 7: Hoare triple {96672#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96672#true} is VALID [2022-04-28 15:32:05,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {96672#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {96672#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {96672#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {96672#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {96672#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {96672#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {96672#true} assume !false; {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {96672#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {96672#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {96672#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {96672#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {96672#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {96672#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {96672#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {96672#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {96672#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {96672#true} assume 8464 == #t~mem55;havoc #t~mem55; {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {96672#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {96672#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {96672#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {96672#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {96672#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {96672#true} ~skip~0 := 0; {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {96672#true} assume !false; {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {96672#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {96672#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {96672#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {96672#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {96672#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {96672#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {96672#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {96672#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {96672#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {96672#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {96672#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {96672#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {96672#true} assume 8496 == #t~mem58;havoc #t~mem58; {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {96672#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {96672#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {96672#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {96672#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {96672#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {96672#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {96672#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96672#true} is VALID [2022-04-28 15:32:05,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {96672#true} ~skip~0 := 0; {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {96672#true} assume !false; {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {96672#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {96672#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {96672#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {96672#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {96672#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 59: Hoare triple {96672#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {96672#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {96672#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {96672#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {96672#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {96672#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {96672#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {96672#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {96672#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-28 15:32:05,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {96672#true} assume 8512 == #t~mem60;havoc #t~mem60; {96672#true} is VALID [2022-04-28 15:32:05,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {96672#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {96672#true} is VALID [2022-04-28 15:32:05,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {96672#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96672#true} is VALID [2022-04-28 15:32:05,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {96672#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,438 INFO L290 TraceCheckUtils]: 73: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,438 INFO L290 TraceCheckUtils]: 74: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,438 INFO L290 TraceCheckUtils]: 75: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,438 INFO L290 TraceCheckUtils]: 76: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,438 INFO L290 TraceCheckUtils]: 77: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,439 INFO L290 TraceCheckUtils]: 78: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,439 INFO L290 TraceCheckUtils]: 79: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,439 INFO L290 TraceCheckUtils]: 80: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,439 INFO L290 TraceCheckUtils]: 81: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,439 INFO L290 TraceCheckUtils]: 82: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,440 INFO L290 TraceCheckUtils]: 84: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,440 INFO L290 TraceCheckUtils]: 85: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,440 INFO L290 TraceCheckUtils]: 86: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,441 INFO L290 TraceCheckUtils]: 87: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,441 INFO L290 TraceCheckUtils]: 88: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,441 INFO L290 TraceCheckUtils]: 89: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,441 INFO L290 TraceCheckUtils]: 90: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,441 INFO L290 TraceCheckUtils]: 91: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,442 INFO L290 TraceCheckUtils]: 92: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,442 INFO L290 TraceCheckUtils]: 93: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,442 INFO L290 TraceCheckUtils]: 94: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,442 INFO L290 TraceCheckUtils]: 95: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,442 INFO L290 TraceCheckUtils]: 96: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,443 INFO L290 TraceCheckUtils]: 97: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,443 INFO L290 TraceCheckUtils]: 98: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,443 INFO L290 TraceCheckUtils]: 99: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,443 INFO L290 TraceCheckUtils]: 100: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,443 INFO L290 TraceCheckUtils]: 101: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,444 INFO L290 TraceCheckUtils]: 102: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,444 INFO L290 TraceCheckUtils]: 103: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,444 INFO L290 TraceCheckUtils]: 104: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,444 INFO L290 TraceCheckUtils]: 105: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,444 INFO L290 TraceCheckUtils]: 106: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,445 INFO L290 TraceCheckUtils]: 107: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,445 INFO L290 TraceCheckUtils]: 108: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,445 INFO L290 TraceCheckUtils]: 109: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,445 INFO L290 TraceCheckUtils]: 110: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,446 INFO L290 TraceCheckUtils]: 111: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,446 INFO L290 TraceCheckUtils]: 112: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,446 INFO L290 TraceCheckUtils]: 113: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,446 INFO L290 TraceCheckUtils]: 114: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,446 INFO L290 TraceCheckUtils]: 115: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,447 INFO L290 TraceCheckUtils]: 116: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,447 INFO L290 TraceCheckUtils]: 117: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,447 INFO L290 TraceCheckUtils]: 118: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,447 INFO L290 TraceCheckUtils]: 119: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,447 INFO L290 TraceCheckUtils]: 120: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,448 INFO L290 TraceCheckUtils]: 121: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,448 INFO L290 TraceCheckUtils]: 122: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,448 INFO L290 TraceCheckUtils]: 123: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,448 INFO L290 TraceCheckUtils]: 124: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,448 INFO L290 TraceCheckUtils]: 125: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,449 INFO L290 TraceCheckUtils]: 126: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,450 INFO L290 TraceCheckUtils]: 127: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,450 INFO L290 TraceCheckUtils]: 128: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,450 INFO L290 TraceCheckUtils]: 129: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,450 INFO L290 TraceCheckUtils]: 130: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:32:05,451 INFO L290 TraceCheckUtils]: 131: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 7 == ~blastFlag~0; {96673#false} is VALID [2022-04-28 15:32:05,451 INFO L290 TraceCheckUtils]: 132: Hoare triple {96673#false} assume !false; {96673#false} is VALID [2022-04-28 15:32:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 15:32:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:05,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679830425] [2022-04-28 15:32:05,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679830425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:05,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:05,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:32:05,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:05,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200031009] [2022-04-28 15:32:05,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200031009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:05,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:05,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:32:05,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578758737] [2022-04-28 15:32:05,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:05,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have 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-28 15:32:05,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:05,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:05,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:05,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:32:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:05,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:32:05,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:32:05,515 INFO L87 Difference]: Start difference. First operand 984 states and 1451 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:07,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:08,993 INFO L93 Difference]: Finished difference Result 2407 states and 3569 transitions. [2022-04-28 15:32:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:32:08,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have 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-28 15:32:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:32:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:32:08,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-28 15:32:09,388 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-28 15:32:09,473 INFO L225 Difference]: With dead ends: 2407 [2022-04-28 15:32:09,473 INFO L226 Difference]: Without dead ends: 1451 [2022-04-28 15:32:09,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:32:09,474 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:09,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 244 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:32:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-28 15:32:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-28 15:32:09,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:09,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:09,797 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:09,798 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:09,848 INFO L93 Difference]: Finished difference Result 1451 states and 2148 transitions. [2022-04-28 15:32:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2148 transitions. [2022-04-28 15:32:09,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:09,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:09,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-28 15:32:09,851 INFO L87 Difference]: Start difference. First operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-28 15:32:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:09,913 INFO L93 Difference]: Finished difference Result 1451 states and 2148 transitions. [2022-04-28 15:32:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2148 transitions. [2022-04-28 15:32:09,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:09,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:09,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:09,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2147 transitions. [2022-04-28 15:32:09,993 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2147 transitions. Word has length 133 [2022-04-28 15:32:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:09,993 INFO L495 AbstractCegarLoop]: Abstraction has 1449 states and 2147 transitions. [2022-04-28 15:32:09,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:09,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2147 transitions. [2022-04-28 15:32:11,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2147 edges. 2147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2147 transitions. [2022-04-28 15:32:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 15:32:11,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:11,467 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:32:11,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 15:32:11,467 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 1 times [2022-04-28 15:32:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:11,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287367793] [2022-04-28 15:32:11,565 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:11,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 2 times [2022-04-28 15:32:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:11,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179261512] [2022-04-28 15:32:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:11,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {107304#(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(196, 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); {107295#true} is VALID [2022-04-28 15:32:11,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {107295#true} assume true; {107295#true} is VALID [2022-04-28 15:32:11,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107295#true} {107295#true} #690#return; {107295#true} is VALID [2022-04-28 15:32:11,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {107295#true} call ULTIMATE.init(); {107304#(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-28 15:32:11,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {107304#(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(196, 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); {107295#true} is VALID [2022-04-28 15:32:11,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {107295#true} assume true; {107295#true} is VALID [2022-04-28 15:32:11,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107295#true} {107295#true} #690#return; {107295#true} is VALID [2022-04-28 15:32:11,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {107295#true} call #t~ret161 := main(); {107295#true} is VALID [2022-04-28 15:32:11,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {107295#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {107295#true} is VALID [2022-04-28 15:32:11,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {107295#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {107300#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-28 15:32:11,907 INFO L272 TraceCheckUtils]: 7: Hoare triple {107300#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {107301#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-28 15:32:11,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {107301#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:32:11,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:32:11,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:32:11,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:32:11,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {107303#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-28 15:32:11,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {107303#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {107296#false} is VALID [2022-04-28 15:32:11,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-28 15:32:11,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {107296#false} assume 8464 == #t~mem55;havoc #t~mem55; {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {107296#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {107296#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107296#false} is VALID [2022-04-28 15:32:11,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {107296#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {107296#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {107296#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {107296#false} ~skip~0 := 0; {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {107296#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {107296#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {107296#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {107296#false} assume 8496 == #t~mem58;havoc #t~mem58; {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {107296#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {107296#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {107296#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {107296#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {107296#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {107296#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {107296#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {107296#false} ~skip~0 := 0; {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 59: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 60: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 61: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 62: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 63: Hoare triple {107296#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {107296#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 65: Hoare triple {107296#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 66: Hoare triple {107296#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 67: Hoare triple {107296#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 68: Hoare triple {107296#false} assume 8512 == #t~mem60;havoc #t~mem60; {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 69: Hoare triple {107296#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {107296#false} is VALID [2022-04-28 15:32:11,935 INFO L290 TraceCheckUtils]: 70: Hoare triple {107296#false} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {107296#false} is VALID [2022-04-28 15:32:11,936 INFO L290 TraceCheckUtils]: 71: Hoare triple {107296#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {107296#false} is VALID [2022-04-28 15:32:11,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {107296#false} assume !(~ret~0 <= 0); {107296#false} is VALID [2022-04-28 15:32:11,936 INFO L290 TraceCheckUtils]: 73: Hoare triple {107296#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,936 INFO L290 TraceCheckUtils]: 74: Hoare triple {107296#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,936 INFO L290 TraceCheckUtils]: 75: Hoare triple {107296#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107296#false} is VALID [2022-04-28 15:32:11,936 INFO L290 TraceCheckUtils]: 76: Hoare triple {107296#false} ~skip~0 := 0; {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 81: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 82: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 83: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 84: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 86: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 87: Hoare triple {107296#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 88: Hoare triple {107296#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 89: Hoare triple {107296#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 90: Hoare triple {107296#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,937 INFO L290 TraceCheckUtils]: 91: Hoare triple {107296#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 92: Hoare triple {107296#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 93: Hoare triple {107296#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 94: Hoare triple {107296#false} assume 8528 == #t~mem62;havoc #t~mem62; {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 95: Hoare triple {107296#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 96: Hoare triple {107296#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 97: Hoare triple {107296#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 98: Hoare triple {107296#false} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 99: Hoare triple {107296#false} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 100: Hoare triple {107296#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 101: Hoare triple {107296#false} assume !(~ret~0 <= 0); {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 102: Hoare triple {107296#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 103: Hoare triple {107296#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 104: Hoare triple {107296#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 105: Hoare triple {107296#false} ~skip~0 := 0; {107296#false} is VALID [2022-04-28 15:32:11,938 INFO L290 TraceCheckUtils]: 106: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 107: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 108: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 109: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 110: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 111: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 112: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 113: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 114: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 115: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 116: Hoare triple {107296#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 117: Hoare triple {107296#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 118: Hoare triple {107296#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 119: Hoare triple {107296#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,939 INFO L290 TraceCheckUtils]: 120: Hoare triple {107296#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 121: Hoare triple {107296#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 122: Hoare triple {107296#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 123: Hoare triple {107296#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 124: Hoare triple {107296#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 125: Hoare triple {107296#false} assume 8544 == #t~mem64;havoc #t~mem64; {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 126: Hoare triple {107296#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 127: Hoare triple {107296#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 128: Hoare triple {107296#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 129: Hoare triple {107296#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 130: Hoare triple {107296#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 131: Hoare triple {107296#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 132: Hoare triple {107296#false} assume 7 == ~blastFlag~0; {107296#false} is VALID [2022-04-28 15:32:11,940 INFO L290 TraceCheckUtils]: 133: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-28 15:32:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-28 15:32:11,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:11,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179261512] [2022-04-28 15:32:11,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179261512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:11,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:11,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:32:11,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:11,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287367793] [2022-04-28 15:32:11,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287367793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:11,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:11,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:32:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541243722] [2022-04-28 15:32:11,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:11,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have 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-28 15:32:11,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:11,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:12,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:12,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:32:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:32:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:32:12,019 INFO L87 Difference]: Start difference. First operand 1449 states and 2147 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:14,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:16,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:18,866 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-28 15:32:21,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:23,954 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-28 15:32:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:26,082 INFO L93 Difference]: Finished difference Result 2891 states and 4286 transitions. [2022-04-28 15:32:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:32:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have 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-28 15:32:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-28 15:32:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-28 15:32:26,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-28 15:32:26,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:26,409 INFO L225 Difference]: With dead ends: 2891 [2022-04-28 15:32:26,409 INFO L226 Difference]: Without dead ends: 1449 [2022-04-28 15:32:26,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 15:32:26,411 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:26,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 3 Unknown, 0 Unchecked, 10.2s Time] [2022-04-28 15:32:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2022-04-28 15:32:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1449. [2022-04-28 15:32:26,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:26,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1449 states. Second operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:26,835 INFO L74 IsIncluded]: Start isIncluded. First operand 1449 states. Second operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:26,836 INFO L87 Difference]: Start difference. First operand 1449 states. Second operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:26,886 INFO L93 Difference]: Finished difference Result 1449 states and 2146 transitions. [2022-04-28 15:32:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2146 transitions. [2022-04-28 15:32:26,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:26,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:26,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1449 states. [2022-04-28 15:32:26,890 INFO L87 Difference]: Start difference. First operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1449 states. [2022-04-28 15:32:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:26,941 INFO L93 Difference]: Finished difference Result 1449 states and 2146 transitions. [2022-04-28 15:32:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2146 transitions. [2022-04-28 15:32:26,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:26,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:26,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:26,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2146 transitions. [2022-04-28 15:32:27,043 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2146 transitions. Word has length 134 [2022-04-28 15:32:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:27,043 INFO L495 AbstractCegarLoop]: Abstraction has 1449 states and 2146 transitions. [2022-04-28 15:32:27,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:27,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2146 transitions. [2022-04-28 15:32:28,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2146 edges. 2146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2146 transitions. [2022-04-28 15:32:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 15:32:28,718 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:28,718 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:32:28,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 15:32:28,719 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2056535233, now seen corresponding path program 1 times [2022-04-28 15:32:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:28,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [35497725] [2022-04-28 15:32:28,811 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:28,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2056535233, now seen corresponding path program 2 times [2022-04-28 15:32:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:28,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133184299] [2022-04-28 15:32:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:32:29,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 15:32:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:32:29,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 15:32:29,438 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 15:32:29,438 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 15:32:29,443 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:32:29,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 15:32:29,446 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 15:32:29,450 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:32:29,475 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:32:29,475 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-28 15:32:29,475 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1095 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1095 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1767 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1767 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:32:29,476 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1095-2 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1095-2 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1767-1 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1105 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-28 15:32:29,477 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1751 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1751 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1751-2 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 15:32:29,478 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-28 15:32:29,479 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1716 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1716 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1717 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1717 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1716-1 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1718 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1718 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1720 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1720 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1718-2 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1718-2 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-28 15:32:29,480 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1729 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1729 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1383-2 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1392-2 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 15:32:29,481 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1413-2 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1421 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1421 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1437 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1437 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1474 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1511 has no Hoare annotation [2022-04-28 15:32:29,482 WARN L170 areAnnotationChecker]: L1511 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1437-2 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1437-2 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1424-1 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1521-1 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1429 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1429 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1487 has no Hoare annotation [2022-04-28 15:32:29,483 WARN L170 areAnnotationChecker]: L1487 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1539 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1539 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1429-2 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1429-2 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-28 15:32:29,484 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1588-2 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1588-2 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1600 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1600 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1610 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1610 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1600-2 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1617-2 has no Hoare annotation [2022-04-28 15:32:29,485 WARN L170 areAnnotationChecker]: L1617-2 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1639 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1639 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1639-2 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1639-2 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1650 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1650 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1660 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1660 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1650-2 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1664 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1664 has no Hoare annotation [2022-04-28 15:32:29,486 WARN L170 areAnnotationChecker]: L1660-1 has no Hoare annotation [2022-04-28 15:32:29,486 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 15:32:29,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:32:29 BoogieIcfgContainer [2022-04-28 15:32:29,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:32:29,488 INFO L158 Benchmark]: Toolchain (without parser) took 337408.49ms. Allocated memory was 170.9MB in the beginning and 247.5MB in the end (delta: 76.5MB). Free memory was 118.8MB in the beginning and 93.0MB in the end (delta: 25.8MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. [2022-04-28 15:32:29,488 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:32:29,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.35ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 118.7MB in the beginning and 158.6MB in the end (delta: -40.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-28 15:32:29,488 INFO L158 Benchmark]: Boogie Preprocessor took 125.64ms. Allocated memory is still 205.5MB. Free memory was 158.6MB in the beginning and 148.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:32:29,488 INFO L158 Benchmark]: RCFGBuilder took 1338.78ms. Allocated memory is still 205.5MB. Free memory was 148.7MB in the beginning and 164.7MB in the end (delta: -16.1MB). Peak memory consumption was 88.8MB. Max. memory is 8.0GB. [2022-04-28 15:32:29,489 INFO L158 Benchmark]: TraceAbstraction took 335383.83ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 164.2MB in the beginning and 93.0MB in the end (delta: 71.3MB). Peak memory consumption was 153.6MB. Max. memory is 8.0GB. [2022-04-28 15:32:29,489 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 550.35ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 118.7MB in the beginning and 158.6MB in the end (delta: -40.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 125.64ms. Allocated memory is still 205.5MB. Free memory was 158.6MB in the beginning and 148.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1338.78ms. Allocated memory is still 205.5MB. Free memory was 148.7MB in the beginning and 164.7MB in the end (delta: -16.1MB). Peak memory consumption was 88.8MB. Max. memory is 8.0GB. * TraceAbstraction took 335383.83ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 164.2MB in the beginning and 93.0MB in the end (delta: 71.3MB). Peak memory consumption was 153.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1757]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1475. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) [L1161] EXPR s->cert [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 [L1378] COND FALSE !(ret <= 0) [L1383] s->hit [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 [L1388] s->init_num = 0 [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 [L1401] COND FALSE !(ret <= 0) [L1407] s->state = 8528 [L1408] s->init_num = 0 [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 [L1442] COND FALSE !(ret <= 0) [L1459] s->state = 8544 [L1460] s->init_num = 0 [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 [L1757] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 189 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 335.3s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 306.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 2745 SdHoareTripleChecker+Valid, 162.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2745 mSDsluCounter, 14810 SdHoareTripleChecker+Invalid, 162.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9119 mSDsCounter, 1008 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13885 IncrementalHoareTripleChecker+Invalid, 14929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1008 mSolverCounterUnsat, 5691 mSDtfsCounter, 13885 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1449occurred in iteration=32, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 1460 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-28 15:32:29,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...