/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.12.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:44:01,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:44:01,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:44:01,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:44:01,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:44:01,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:44:01,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:44:01,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:44:01,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:44:01,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:44:01,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:44:01,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:44:01,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:44:01,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:44:01,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:44:01,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:44:01,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:44:01,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:44:01,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:44:01,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:44:01,420 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:44:01,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:44:01,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:44:01,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:44:01,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:44:01,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:44:01,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:44:01,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:44:01,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:44:01,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:44:01,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:44:01,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:44:01,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:44:01,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:44:01,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:44:01,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:44:01,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:44:01,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:44:01,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:44:01,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:44:01,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:44:01,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:44:01,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:44:01,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:44:01,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:44:01,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:44:01,443 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:44:01,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:44:01,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:44:01,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:44:01,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:44:01,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:44:01,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:44:01,444 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:44:01,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:44:01,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:44:01,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:44:01,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:44:01,446 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:44:01,446 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:44:01,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:44:01,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:44:01,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:44:01,665 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:44:01,673 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:44:01,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.12.i.cil-1.c [2022-04-15 11:44:01,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede76ebf1/d4c5118213a74a5495d7d9ac3dcdcb61/FLAGe8c83dc0a [2022-04-15 11:44:02,127 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:44:02,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.12.i.cil-1.c [2022-04-15 11:44:02,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede76ebf1/d4c5118213a74a5495d7d9ac3dcdcb61/FLAGe8c83dc0a [2022-04-15 11:44:02,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede76ebf1/d4c5118213a74a5495d7d9ac3dcdcb61 [2022-04-15 11:44:02,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:44:02,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:44:02,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:44:02,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:44:02,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:44:02,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f35291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02, skipping insertion in model container [2022-04-15 11:44:02,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:44:02,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:44:02,532 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.12.i.cil-1.c[75166,75179] [2022-04-15 11:44:02,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:44:02,548 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:44:02,631 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.12.i.cil-1.c[75166,75179] [2022-04-15 11:44:02,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:44:02,659 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:44:02,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02 WrapperNode [2022-04-15 11:44:02,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:44:02,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:44:02,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:44:02,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:44:02,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:44:02,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:44:02,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:44:02,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:44:02,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (1/1) ... [2022-04-15 11:44:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:44:02,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:44:02,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:44:02,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:44:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:44:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:44:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:44:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:44:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:44:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:44:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:44:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:44:02,901 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:44:02,902 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:44:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:44:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:44:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:44:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:44:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:44:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:44:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:44:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:44:03,023 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:44:03,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:44:03,806 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:44:04,315 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:44:04,315 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:44:04,323 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:44:04,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:44:04,331 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:44:04,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:44:04 BoogieIcfgContainer [2022-04-15 11:44:04,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:44:04,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:44:04,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:44:04,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:44:04,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:44:02" (1/3) ... [2022-04-15 11:44:04,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbea69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:44:04, skipping insertion in model container [2022-04-15 11:44:04,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:02" (2/3) ... [2022-04-15 11:44:04,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbea69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:44:04, skipping insertion in model container [2022-04-15 11:44:04,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:44:04" (3/3) ... [2022-04-15 11:44:04,342 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-1.c [2022-04-15 11:44:04,349 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:44:04,349 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:44:04,381 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:44:04,394 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:44:04,394 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:44:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 152 states have (on average 1.7105263157894737) internal successors, (260), 153 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:44:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 11:44:04,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:04,427 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:04,427 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:04,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1669369650, now seen corresponding path program 1 times [2022-04-15 11:44:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:04,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9856371] [2022-04-15 11:44:04,443 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:44:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1669369650, now seen corresponding path program 2 times [2022-04-15 11:44:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:04,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064315486] [2022-04-15 11:44:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:04,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:04,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {163#true} is VALID [2022-04-15 11:44:04,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-15 11:44:04,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #705#return; {163#true} is VALID [2022-04-15 11:44:04,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {170#(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-15 11:44:04,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {163#true} is VALID [2022-04-15 11:44:04,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-15 11:44:04,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #705#return; {163#true} is VALID [2022-04-15 11:44:04,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret161 := main(); {163#true} is VALID [2022-04-15 11:44:04,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {163#true} is VALID [2022-04-15 11:44:04,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {163#true} is VALID [2022-04-15 11:44:04,861 INFO L272 TraceCheckUtils]: 7: Hoare triple {163#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {163#true} is VALID [2022-04-15 11:44:04,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,880 INFO L290 TraceCheckUtils]: 42: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:04,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {168#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-15 11:44:04,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {169#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {164#false} is VALID [2022-04-15 11:44:04,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {164#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {164#false} is VALID [2022-04-15 11:44:04,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {164#false} assume !(9 == ~blastFlag~0); {164#false} is VALID [2022-04-15 11:44:04,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-15 11:44:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:04,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:04,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064315486] [2022-04-15 11:44:04,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064315486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:04,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:04,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:04,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:04,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9856371] [2022-04-15 11:44:04,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9856371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:04,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:04,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:04,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247286227] [2022-04-15 11:44:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 11:44:04,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:04,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:04,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:04,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:04,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:04,947 INFO L87 Difference]: Start difference. First operand has 160 states, 152 states have (on average 1.7105263157894737) internal successors, (260), 153 states have internal predecessors, (260), 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 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:12,463 INFO L93 Difference]: Finished difference Result 437 states and 740 transitions. [2022-04-15 11:44:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 11:44:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2022-04-15 11:44:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2022-04-15 11:44:12,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 740 transitions. [2022-04-15 11:44:13,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 740 edges. 740 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:13,037 INFO L225 Difference]: With dead ends: 437 [2022-04-15 11:44:13,037 INFO L226 Difference]: Without dead ends: 266 [2022-04-15 11:44:13,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:13,047 INFO L913 BasicCegarLoop]: 161 mSDtfsCounter, 160 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:13,048 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 473 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 11:44:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-15 11:44:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 184. [2022-04-15 11:44:13,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:13,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 184 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 179 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,084 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 184 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 179 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,085 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 184 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 179 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:13,096 INFO L93 Difference]: Finished difference Result 266 states and 409 transitions. [2022-04-15 11:44:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2022-04-15 11:44:13,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:13,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:13,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 179 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-15 11:44:13,107 INFO L87 Difference]: Start difference. First operand has 184 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 179 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-15 11:44:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:13,118 INFO L93 Difference]: Finished difference Result 266 states and 409 transitions. [2022-04-15 11:44:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2022-04-15 11:44:13,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:13,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:13,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:13,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 179 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 292 transitions. [2022-04-15 11:44:13,128 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 292 transitions. Word has length 48 [2022-04-15 11:44:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:13,129 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 292 transitions. [2022-04-15 11:44:13,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 292 transitions. [2022-04-15 11:44:13,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 292 transitions. [2022-04-15 11:44:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 11:44:13,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:13,354 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:13,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:44:13,354 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:13,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash 203097938, now seen corresponding path program 1 times [2022-04-15 11:44:13,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:13,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [869985455] [2022-04-15 11:44:13,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:44:13,357 INFO L85 PathProgramCache]: Analyzing trace with hash 203097938, now seen corresponding path program 2 times [2022-04-15 11:44:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:13,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570401944] [2022-04-15 11:44:13,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:13,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:13,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {1956#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1949#true} is VALID [2022-04-15 11:44:13,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {1949#true} assume true; {1949#true} is VALID [2022-04-15 11:44:13,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1949#true} {1949#true} #705#return; {1949#true} is VALID [2022-04-15 11:44:13,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {1949#true} call ULTIMATE.init(); {1956#(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-15 11:44:13,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {1956#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1949#true} is VALID [2022-04-15 11:44:13,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {1949#true} assume true; {1949#true} is VALID [2022-04-15 11:44:13,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1949#true} {1949#true} #705#return; {1949#true} is VALID [2022-04-15 11:44:13,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {1949#true} call #t~ret161 := main(); {1949#true} is VALID [2022-04-15 11:44:13,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {1949#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1949#true} is VALID [2022-04-15 11:44:13,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1949#true} is VALID [2022-04-15 11:44:13,566 INFO L272 TraceCheckUtils]: 7: Hoare triple {1949#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1949#true} is VALID [2022-04-15 11:44:13,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {1949#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {1954#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1955#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:44:13,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {1955#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {1950#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {1950#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {1950#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {1950#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {1950#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {1950#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {1950#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {1950#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {1950#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {1950#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {1950#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {1950#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {1950#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {1950#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {1950#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {1950#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {1950#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {1950#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {1950#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {1950#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1950#false} is VALID [2022-04-15 11:44:13,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {1950#false} assume 8641 == #t~mem76;havoc #t~mem76; {1950#false} is VALID [2022-04-15 11:44:13,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {1950#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1950#false} is VALID [2022-04-15 11:44:13,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {1950#false} assume !(9 == ~blastFlag~0); {1950#false} is VALID [2022-04-15 11:44:13,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {1950#false} assume !false; {1950#false} is VALID [2022-04-15 11:44:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:13,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570401944] [2022-04-15 11:44:13,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570401944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:13,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:13,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:13,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:13,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [869985455] [2022-04-15 11:44:13,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [869985455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:13,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:13,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257172065] [2022-04-15 11:44:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:13,592 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-15 11:44:13,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:13,592 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-15 11:44:13,627 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-15 11:44:13,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:13,628 INFO L87 Difference]: Start difference. First operand 184 states and 292 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-15 11:44:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:18,368 INFO L93 Difference]: Finished difference Result 381 states and 606 transitions. [2022-04-15 11:44:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:18,369 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-15 11:44:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:18,369 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-15 11:44:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-15 11:44:18,373 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-15 11:44:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-15 11:44:18,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 460 transitions. [2022-04-15 11:44:18,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:18,704 INFO L225 Difference]: With dead ends: 381 [2022-04-15 11:44:18,704 INFO L226 Difference]: Without dead ends: 212 [2022-04-15 11:44:18,705 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:18,706 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 22 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:18,706 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 493 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 11:44:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-15 11:44:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2022-04-15 11:44:18,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:18,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 195 states, 190 states have (on average 1.6157894736842104) internal successors, (307), 190 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:18,722 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 195 states, 190 states have (on average 1.6157894736842104) internal successors, (307), 190 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:18,722 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 195 states, 190 states have (on average 1.6157894736842104) internal successors, (307), 190 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:18,730 INFO L93 Difference]: Finished difference Result 212 states and 332 transitions. [2022-04-15 11:44:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 332 transitions. [2022-04-15 11:44:18,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:18,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:18,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 190 states have (on average 1.6157894736842104) internal successors, (307), 190 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-15 11:44:18,732 INFO L87 Difference]: Start difference. First operand has 195 states, 190 states have (on average 1.6157894736842104) internal successors, (307), 190 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-15 11:44:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:18,740 INFO L93 Difference]: Finished difference Result 212 states and 332 transitions. [2022-04-15 11:44:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 332 transitions. [2022-04-15 11:44:18,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:18,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:18,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:18,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.6157894736842104) internal successors, (307), 190 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 311 transitions. [2022-04-15 11:44:18,749 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 311 transitions. Word has length 49 [2022-04-15 11:44:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:18,749 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 311 transitions. [2022-04-15 11:44:18,749 INFO L479 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-15 11:44:18,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 311 transitions. [2022-04-15 11:44:18,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2022-04-15 11:44:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 11:44:18,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:18,954 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:18,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:44:18,955 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:18,955 INFO L85 PathProgramCache]: Analyzing trace with hash 143721976, now seen corresponding path program 1 times [2022-04-15 11:44:18,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:18,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005339004] [2022-04-15 11:44:18,978 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:18,978 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:18,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 143721976, now seen corresponding path program 2 times [2022-04-15 11:44:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:18,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585945180] [2022-04-15 11:44:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:19,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:19,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {3544#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3537#true} is VALID [2022-04-15 11:44:19,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {3537#true} assume true; {3537#true} is VALID [2022-04-15 11:44:19,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3537#true} {3537#true} #705#return; {3537#true} is VALID [2022-04-15 11:44:19,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {3537#true} call ULTIMATE.init(); {3544#(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-15 11:44:19,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {3544#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3537#true} is VALID [2022-04-15 11:44:19,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {3537#true} assume true; {3537#true} is VALID [2022-04-15 11:44:19,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3537#true} {3537#true} #705#return; {3537#true} is VALID [2022-04-15 11:44:19,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {3537#true} call #t~ret161 := main(); {3537#true} is VALID [2022-04-15 11:44:19,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {3537#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3537#true} is VALID [2022-04-15 11:44:19,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {3537#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3537#true} is VALID [2022-04-15 11:44:19,091 INFO L272 TraceCheckUtils]: 7: Hoare triple {3537#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3537#true} is VALID [2022-04-15 11:44:19,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {3537#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:19,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {3542#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3543#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-15 11:44:19,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {3543#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {3538#false} is VALID [2022-04-15 11:44:19,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {3538#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {3538#false} is VALID [2022-04-15 11:44:19,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {3538#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {3538#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {3538#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3538#false} is VALID [2022-04-15 11:44:19,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {3538#false} ~skip~0 := 0; {3538#false} is VALID [2022-04-15 11:44:19,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {3538#false} assume !false; {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {3538#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {3538#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {3538#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {3538#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {3538#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {3538#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {3538#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {3538#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {3538#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {3538#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {3538#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {3538#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {3538#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {3538#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {3538#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {3538#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {3538#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {3538#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {3538#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 47: Hoare triple {3538#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 48: Hoare triple {3538#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {3538#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {3538#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {3538#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {3538#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {3538#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {3538#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {3538#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {3538#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3538#false} is VALID [2022-04-15 11:44:19,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {3538#false} assume 8641 == #t~mem76;havoc #t~mem76; {3538#false} is VALID [2022-04-15 11:44:19,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {3538#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3538#false} is VALID [2022-04-15 11:44:19,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {3538#false} assume !(9 == ~blastFlag~0); {3538#false} is VALID [2022-04-15 11:44:19,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {3538#false} assume !false; {3538#false} is VALID [2022-04-15 11:44:19,115 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-15 11:44:19,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:19,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585945180] [2022-04-15 11:44:19,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585945180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:19,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:19,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:19,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:19,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005339004] [2022-04-15 11:44:19,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005339004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:19,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:19,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443086663] [2022-04-15 11:44:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:19,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 11:44:19,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:19,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:19,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:19,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:19,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:19,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:19,160 INFO L87 Difference]: Start difference. First operand 195 states and 311 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:22,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:24,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:26,853 INFO L93 Difference]: Finished difference Result 381 states and 605 transitions. [2022-04-15 11:44:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:26,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 11:44:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-15 11:44:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-15 11:44:26,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 459 transitions. [2022-04-15 11:44:27,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:27,182 INFO L225 Difference]: With dead ends: 381 [2022-04-15 11:44:27,182 INFO L226 Difference]: Without dead ends: 212 [2022-04-15 11:44:27,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:27,191 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 24 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:27,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 495 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 11:44:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-15 11:44:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2022-04-15 11:44:27,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:27,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 195 states, 190 states have (on average 1.6105263157894736) internal successors, (306), 190 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:27,205 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 195 states, 190 states have (on average 1.6105263157894736) internal successors, (306), 190 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:27,205 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 195 states, 190 states have (on average 1.6105263157894736) internal successors, (306), 190 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:27,214 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2022-04-15 11:44:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2022-04-15 11:44:27,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:27,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:27,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 190 states have (on average 1.6105263157894736) internal successors, (306), 190 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-15 11:44:27,215 INFO L87 Difference]: Start difference. First operand has 195 states, 190 states have (on average 1.6105263157894736) internal successors, (306), 190 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-15 11:44:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:27,219 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2022-04-15 11:44:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2022-04-15 11:44:27,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:27,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:27,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:27,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.6105263157894736) internal successors, (306), 190 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 310 transitions. [2022-04-15 11:44:27,224 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 310 transitions. Word has length 62 [2022-04-15 11:44:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:27,224 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 310 transitions. [2022-04-15 11:44:27,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:27,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 310 transitions. [2022-04-15 11:44:27,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 310 transitions. [2022-04-15 11:44:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 11:44:27,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:27,420 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:27,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:44:27,420 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2075650552, now seen corresponding path program 1 times [2022-04-15 11:44:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:27,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [81432808] [2022-04-15 11:44:27,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:27,467 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:27,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2075650552, now seen corresponding path program 2 times [2022-04-15 11:44:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:27,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761276437] [2022-04-15 11:44:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:27,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:27,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {5132#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5125#true} is VALID [2022-04-15 11:44:27,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {5125#true} assume true; {5125#true} is VALID [2022-04-15 11:44:27,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5125#true} {5125#true} #705#return; {5125#true} is VALID [2022-04-15 11:44:27,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {5125#true} call ULTIMATE.init(); {5132#(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-15 11:44:27,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {5132#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5125#true} is VALID [2022-04-15 11:44:27,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {5125#true} assume true; {5125#true} is VALID [2022-04-15 11:44:27,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5125#true} {5125#true} #705#return; {5125#true} is VALID [2022-04-15 11:44:27,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {5125#true} call #t~ret161 := main(); {5125#true} is VALID [2022-04-15 11:44:27,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {5125#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5125#true} is VALID [2022-04-15 11:44:27,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {5125#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5125#true} is VALID [2022-04-15 11:44:27,619 INFO L272 TraceCheckUtils]: 7: Hoare triple {5125#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5125#true} is VALID [2022-04-15 11:44:27,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {5125#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:27,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:27,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:27,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:27,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:27,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:27,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:27,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {5130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5131#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {5131#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {5126#false} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {5126#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {5126#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {5126#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5126#false} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {5126#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {5126#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {5126#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {5126#false} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {5126#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {5126#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {5126#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {5126#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5126#false} is VALID [2022-04-15 11:44:27,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {5126#false} ~skip~0 := 0; {5126#false} is VALID [2022-04-15 11:44:27,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {5126#false} assume !false; {5126#false} is VALID [2022-04-15 11:44:27,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {5126#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {5126#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {5126#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {5126#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {5126#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {5126#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {5126#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {5126#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {5126#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {5126#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {5126#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {5126#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {5126#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {5126#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {5126#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {5126#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {5126#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {5126#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {5126#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {5126#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {5126#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {5126#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {5126#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {5126#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {5126#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {5126#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {5126#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {5126#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {5126#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 58: Hoare triple {5126#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 59: Hoare triple {5126#false} assume 8641 == #t~mem76;havoc #t~mem76; {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 60: Hoare triple {5126#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5126#false} is VALID [2022-04-15 11:44:27,633 INFO L290 TraceCheckUtils]: 61: Hoare triple {5126#false} assume !(9 == ~blastFlag~0); {5126#false} is VALID [2022-04-15 11:44:27,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {5126#false} assume !false; {5126#false} is VALID [2022-04-15 11:44:27,635 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-15 11:44:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:27,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761276437] [2022-04-15 11:44:27,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761276437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:27,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:27,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:27,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:27,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [81432808] [2022-04-15 11:44:27,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [81432808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:27,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:27,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:27,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153365952] [2022-04-15 11:44:27,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:27,637 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-15 11:44:27,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:27,638 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-15 11:44:27,677 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-15 11:44:27,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:27,679 INFO L87 Difference]: Start difference. First operand 195 states and 310 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-15 11:44:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:34,679 INFO L93 Difference]: Finished difference Result 380 states and 603 transitions. [2022-04-15 11:44:34,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:34,679 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-15 11:44:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:34,685 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-15 11:44:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-15 11:44:34,687 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-15 11:44:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-15 11:44:34,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-04-15 11:44:34,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:34,971 INFO L225 Difference]: With dead ends: 380 [2022-04-15 11:44:34,971 INFO L226 Difference]: Without dead ends: 211 [2022-04-15 11:44:34,971 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:34,972 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 28 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:34,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 497 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:44:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-15 11:44:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2022-04-15 11:44:34,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:34,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 195 states, 190 states have (on average 1.605263157894737) internal successors, (305), 190 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:34,981 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 195 states, 190 states have (on average 1.605263157894737) internal successors, (305), 190 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:34,981 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 195 states, 190 states have (on average 1.605263157894737) internal successors, (305), 190 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:35,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:35,002 INFO L93 Difference]: Finished difference Result 211 states and 329 transitions. [2022-04-15 11:44:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 329 transitions. [2022-04-15 11:44:35,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:35,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:35,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 190 states have (on average 1.605263157894737) internal successors, (305), 190 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 211 states. [2022-04-15 11:44:35,003 INFO L87 Difference]: Start difference. First operand has 195 states, 190 states have (on average 1.605263157894737) internal successors, (305), 190 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 211 states. [2022-04-15 11:44:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:35,008 INFO L93 Difference]: Finished difference Result 211 states and 329 transitions. [2022-04-15 11:44:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 329 transitions. [2022-04-15 11:44:35,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:35,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:35,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:35,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.605263157894737) internal successors, (305), 190 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 309 transitions. [2022-04-15 11:44:35,013 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 309 transitions. Word has length 63 [2022-04-15 11:44:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:35,013 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 309 transitions. [2022-04-15 11:44:35,013 INFO L479 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-15 11:44:35,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 309 transitions. [2022-04-15 11:44:35,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 309 transitions. [2022-04-15 11:44:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 11:44:35,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:35,228 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:35,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:44:35,228 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1171805940, now seen corresponding path program 1 times [2022-04-15 11:44:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:35,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1215815757] [2022-04-15 11:44:35,391 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:44:35,392 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:44:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash -994219601, now seen corresponding path program 1 times [2022-04-15 11:44:35,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:35,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59006638] [2022-04-15 11:44:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:35,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:35,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {6716#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6709#true} is VALID [2022-04-15 11:44:35,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {6709#true} assume true; {6709#true} is VALID [2022-04-15 11:44:35,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6709#true} {6709#true} #705#return; {6709#true} is VALID [2022-04-15 11:44:35,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {6709#true} call ULTIMATE.init(); {6716#(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-15 11:44:35,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {6716#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6709#true} is VALID [2022-04-15 11:44:35,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {6709#true} assume true; {6709#true} is VALID [2022-04-15 11:44:35,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6709#true} {6709#true} #705#return; {6709#true} is VALID [2022-04-15 11:44:35,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {6709#true} call #t~ret161 := main(); {6709#true} is VALID [2022-04-15 11:44:35,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {6709#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6709#true} is VALID [2022-04-15 11:44:35,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {6709#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6709#true} is VALID [2022-04-15 11:44:35,592 INFO L272 TraceCheckUtils]: 7: Hoare triple {6709#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6709#true} is VALID [2022-04-15 11:44:35,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {6709#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} [711] L1168-2-->L1169_primed: Formula: (let ((.cse0 (= |v_#memory_$Pointer$.offset_262| |v_#memory_$Pointer$.offset_256|)) (.cse1 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse2 (= v_ssl3_accept_~skip~0_16 v_ssl3_accept_~skip~0_15)) (.cse3 (= |v_ssl3_accept_#t~mem47_12| |v_ssl3_accept_#t~mem47_10|)) (.cse4 (= |v_ssl3_accept_#t~mem150.base_10| |v_ssl3_accept_#t~mem150.base_8|)) (.cse5 (= v_ssl3_accept_~state~0_8 v_ssl3_accept_~state~0_7)) (.cse6 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse7 (= |v_ssl3_accept_#t~mem48_10| |v_ssl3_accept_#t~mem48_8|)) (.cse8 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse9 (= |v_ssl3_accept_#t~mem46_6| |v_ssl3_accept_#t~mem46_5|)) (.cse10 (= |v_ssl3_accept_#t~mem151_12| |v_ssl3_accept_#t~mem151_10|)) (.cse11 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse12 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|)) (.cse13 (= |v_#memory_$Pointer$.base_262| |v_#memory_$Pointer$.base_256|))) (or (and .cse0 .cse1 (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_8| |v_ssl3_accept_#t~mem150.offset_10|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_#memory_int_257| |v_#memory_int_262|) (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|) .cse13) (and .cse0 .cse1 .cse2 (= |v_#memory_int_262| |v_#memory_int_257|) .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_10| |v_ssl3_accept_#t~mem150.offset_8|) (= |v_ssl3_accept_#t~mem83.base_10| |v_ssl3_accept_#t~mem83.base_8|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|) .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_262|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_10|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_10|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_12|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_6|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_16, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_262|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_262|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_8} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_257|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} [710] L1169_primed-->L1169: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:35,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {6714#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {6715#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-15 11:44:35,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {6715#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {6710#false} is VALID [2022-04-15 11:44:35,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {6710#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6710#false} is VALID [2022-04-15 11:44:35,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {6710#false} assume !(9 == ~blastFlag~0); {6710#false} is VALID [2022-04-15 11:44:35,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {6710#false} assume !false; {6710#false} is VALID [2022-04-15 11:44:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:35,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59006638] [2022-04-15 11:44:35,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59006638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:35,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:35,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:35,691 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#memory_$Pointer$.offset_272| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_272| c_ssl3_accept_~s.base (let ((.cse0 (+ 36 c_ssl3_accept_~s.offset))) (store (select |v_#memory_$Pointer$.offset_272| c_ssl3_accept_~s.base) .cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse0)))))) (exists ((|v_#memory_int_272| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_272| c_ssl3_accept_~s.base))) (let ((.cse2 (select .cse1 (+ 52 c_ssl3_accept_~s.offset)))) (and (= (store |v_#memory_int_272| c_ssl3_accept_~s.base (store .cse1 (+ 36 c_ssl3_accept_~s.offset) 1)) |c_#memory_int|) (= c_ssl3_accept_~state~0 .cse2) (= .cse2 16384))))) (exists ((|v_#memory_$Pointer$.base_272| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_272| c_ssl3_accept_~s.base (let ((.cse3 (+ 36 c_ssl3_accept_~s.offset))) (store (select |v_#memory_$Pointer$.base_272| c_ssl3_accept_~s.base) .cse3 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse3)))) |c_#memory_$Pointer$.base|))) is different from true [2022-04-15 11:44:38,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:38,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1215815757] [2022-04-15 11:44:38,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1215815757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:38,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:38,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:44:38,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731974471] [2022-04-15 11:44:38,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:38,672 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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-15 11:44:38,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:38,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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-15 11:44:38,756 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-15 11:44:38,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:44:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:38,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:44:38,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=114, Unknown=3, NotChecked=22, Total=182 [2022-04-15 11:44:38,757 INFO L87 Difference]: Start difference. First operand 195 states and 309 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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-15 11:44:41,541 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-15 11:44:43,372 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-15 11:44:45,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:49,267 INFO L93 Difference]: Finished difference Result 486 states and 774 transitions. [2022-04-15 11:44:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:44:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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-15 11:44:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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-15 11:44:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 611 transitions. [2022-04-15 11:44:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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-15 11:44:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 611 transitions. [2022-04-15 11:44:49,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 611 transitions. [2022-04-15 11:44:49,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:49,711 INFO L225 Difference]: With dead ends: 486 [2022-04-15 11:44:49,711 INFO L226 Difference]: Without dead ends: 317 [2022-04-15 11:44:49,712 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=4, NotChecked=26, Total=240 [2022-04-15 11:44:49,712 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 124 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 499 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:49,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 768 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 757 Invalid, 0 Unknown, 499 Unchecked, 5.7s Time] [2022-04-15 11:44:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-15 11:44:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 242. [2022-04-15 11:44:49,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:49,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 242 states, 237 states have (on average 1.6371308016877637) internal successors, (388), 237 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:49,723 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 242 states, 237 states have (on average 1.6371308016877637) internal successors, (388), 237 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:49,724 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 242 states, 237 states have (on average 1.6371308016877637) internal successors, (388), 237 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:49,730 INFO L93 Difference]: Finished difference Result 317 states and 499 transitions. [2022-04-15 11:44:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 499 transitions. [2022-04-15 11:44:49,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:49,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:49,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.6371308016877637) internal successors, (388), 237 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 317 states. [2022-04-15 11:44:49,732 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.6371308016877637) internal successors, (388), 237 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 317 states. [2022-04-15 11:44:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:49,738 INFO L93 Difference]: Finished difference Result 317 states and 499 transitions. [2022-04-15 11:44:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 499 transitions. [2022-04-15 11:44:49,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:49,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:49,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:49,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.6371308016877637) internal successors, (388), 237 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 392 transitions. [2022-04-15 11:44:49,767 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 392 transitions. Word has length 63 [2022-04-15 11:44:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:49,768 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 392 transitions. [2022-04-15 11:44:49,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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-15 11:44:49,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 392 transitions. [2022-04-15 11:44:50,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 392 transitions. [2022-04-15 11:44:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:44:50,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:50,095 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:50,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:44:50,096 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash 196905735, now seen corresponding path program 1 times [2022-04-15 11:44:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:50,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923761110] [2022-04-15 11:44:50,137 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:50,137 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:50,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash 196905735, now seen corresponding path program 2 times [2022-04-15 11:44:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:50,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787496623] [2022-04-15 11:44:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:50,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:50,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:50,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {8829#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8822#true} is VALID [2022-04-15 11:44:50,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {8822#true} assume true; {8822#true} is VALID [2022-04-15 11:44:50,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8822#true} {8822#true} #705#return; {8822#true} is VALID [2022-04-15 11:44:50,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {8822#true} call ULTIMATE.init(); {8829#(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-15 11:44:50,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {8829#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8822#true} is VALID [2022-04-15 11:44:50,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {8822#true} assume true; {8822#true} is VALID [2022-04-15 11:44:50,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8822#true} {8822#true} #705#return; {8822#true} is VALID [2022-04-15 11:44:50,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {8822#true} call #t~ret161 := main(); {8822#true} is VALID [2022-04-15 11:44:50,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {8822#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8822#true} is VALID [2022-04-15 11:44:50,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {8822#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8822#true} is VALID [2022-04-15 11:44:50,262 INFO L272 TraceCheckUtils]: 7: Hoare triple {8822#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8822#true} is VALID [2022-04-15 11:44:50,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {8822#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:50,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:50,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:50,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:50,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:50,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:50,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:50,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:50,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {8827#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8828#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-15 11:44:50,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {8828#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {8823#false} is VALID [2022-04-15 11:44:50,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {8823#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {8823#false} assume !(0 != (~cb~0.base + ~cb~0.offset) % 4294967296); {8823#false} is VALID [2022-04-15 11:44:50,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {8823#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {8823#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {8823#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {8823#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {8823#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {8823#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {8823#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {8823#false} ~skip~0 := 0; {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {8823#false} assume !false; {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {8823#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {8823#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {8823#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {8823#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {8823#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {8823#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {8823#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {8823#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {8823#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {8823#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {8823#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {8823#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {8823#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {8823#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {8823#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {8823#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {8823#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {8823#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {8823#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {8823#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {8823#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {8823#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {8823#false} assume 8448 == #t~mem68;havoc #t~mem68; {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {8823#false} assume !(~num1~0 > 0); {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {8823#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {8823#false} is VALID [2022-04-15 11:44:50,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {8823#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {8823#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {8823#false} ~skip~0 := 0; {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {8823#false} assume !false; {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {8823#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {8823#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {8823#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {8823#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {8823#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {8823#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {8823#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {8823#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {8823#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {8823#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {8823#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {8823#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {8823#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {8823#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,276 INFO L290 TraceCheckUtils]: 72: Hoare triple {8823#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {8823#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,277 INFO L290 TraceCheckUtils]: 74: Hoare triple {8823#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,277 INFO L290 TraceCheckUtils]: 75: Hoare triple {8823#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,277 INFO L290 TraceCheckUtils]: 76: Hoare triple {8823#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,277 INFO L290 TraceCheckUtils]: 77: Hoare triple {8823#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,278 INFO L290 TraceCheckUtils]: 78: Hoare triple {8823#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,278 INFO L290 TraceCheckUtils]: 79: Hoare triple {8823#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,280 INFO L290 TraceCheckUtils]: 80: Hoare triple {8823#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,280 INFO L290 TraceCheckUtils]: 81: Hoare triple {8823#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 82: Hoare triple {8823#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 83: Hoare triple {8823#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 84: Hoare triple {8823#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 85: Hoare triple {8823#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 86: Hoare triple {8823#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 87: Hoare triple {8823#false} assume 8640 == #t~mem75;havoc #t~mem75; {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 88: Hoare triple {8823#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 89: Hoare triple {8823#false} assume !(9 == ~blastFlag~0); {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L290 TraceCheckUtils]: 90: Hoare triple {8823#false} assume !false; {8823#false} is VALID [2022-04-15 11:44:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:44:50,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:50,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787496623] [2022-04-15 11:44:50,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787496623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:50,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:50,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:50,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:50,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923761110] [2022-04-15 11:44:50,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923761110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:50,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:50,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404764997] [2022-04-15 11:44:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:50,283 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 91 [2022-04-15 11:44:50,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:50,283 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-15 11:44:50,332 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-15 11:44:50,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:50,333 INFO L87 Difference]: Start difference. First operand 242 states and 392 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-15 11:44:55,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:57,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:00,027 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-15 11:45:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:01,277 INFO L93 Difference]: Finished difference Result 532 states and 854 transitions. [2022-04-15 11:45:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:01,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 91 [2022-04-15 11:45:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:01,277 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-15 11:45:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-15 11:45:01,280 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-15 11:45:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-15 11:45:01,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-04-15 11:45:01,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:01,713 INFO L225 Difference]: With dead ends: 532 [2022-04-15 11:45:01,713 INFO L226 Difference]: Without dead ends: 316 [2022-04-15 11:45:01,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:01,714 INFO L913 BasicCegarLoop]: 129 mSDtfsCounter, 154 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:01,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 370 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 11:45:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-15 11:45:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 235. [2022-04-15 11:45:01,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:01,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 235 states, 230 states have (on average 1.6347826086956523) internal successors, (376), 230 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:01,728 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 235 states, 230 states have (on average 1.6347826086956523) internal successors, (376), 230 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:01,729 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 235 states, 230 states have (on average 1.6347826086956523) internal successors, (376), 230 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:01,738 INFO L93 Difference]: Finished difference Result 316 states and 495 transitions. [2022-04-15 11:45:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 495 transitions. [2022-04-15 11:45:01,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:01,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:01,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 230 states have (on average 1.6347826086956523) internal successors, (376), 230 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 316 states. [2022-04-15 11:45:01,740 INFO L87 Difference]: Start difference. First operand has 235 states, 230 states have (on average 1.6347826086956523) internal successors, (376), 230 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 316 states. [2022-04-15 11:45:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:01,750 INFO L93 Difference]: Finished difference Result 316 states and 495 transitions. [2022-04-15 11:45:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 495 transitions. [2022-04-15 11:45:01,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:01,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:01,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:01,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.6347826086956523) internal successors, (376), 230 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 380 transitions. [2022-04-15 11:45:01,759 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 380 transitions. Word has length 91 [2022-04-15 11:45:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:01,760 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 380 transitions. [2022-04-15 11:45:01,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:01,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 380 transitions. [2022-04-15 11:45:02,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 380 transitions. [2022-04-15 11:45:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:45:02,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:02,025 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:02,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:45:02,026 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 814450546, now seen corresponding path program 1 times [2022-04-15 11:45:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:02,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050091193] [2022-04-15 11:45:02,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:02,064 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:02,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:02,064 INFO L85 PathProgramCache]: Analyzing trace with hash 814450546, now seen corresponding path program 2 times [2022-04-15 11:45:02,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:02,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821266620] [2022-04-15 11:45:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:02,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:02,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {11007#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11000#true} is VALID [2022-04-15 11:45:02,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {11000#true} assume true; {11000#true} is VALID [2022-04-15 11:45:02,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11000#true} {11000#true} #705#return; {11000#true} is VALID [2022-04-15 11:45:02,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {11000#true} call ULTIMATE.init(); {11007#(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-15 11:45:02,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {11007#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11000#true} is VALID [2022-04-15 11:45:02,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {11000#true} assume true; {11000#true} is VALID [2022-04-15 11:45:02,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11000#true} {11000#true} #705#return; {11000#true} is VALID [2022-04-15 11:45:02,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {11000#true} call #t~ret161 := main(); {11000#true} is VALID [2022-04-15 11:45:02,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {11000#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11000#true} is VALID [2022-04-15 11:45:02,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {11000#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {11000#true} is VALID [2022-04-15 11:45:02,200 INFO L272 TraceCheckUtils]: 7: Hoare triple {11000#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11000#true} is VALID [2022-04-15 11:45:02,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {11000#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:02,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {11005#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11006#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-15 11:45:02,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {11006#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {11001#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {11001#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {11001#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {11001#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {11001#false} ~skip~0 := 0; {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {11001#false} assume !false; {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {11001#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {11001#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {11001#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {11001#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {11001#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {11001#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {11001#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {11001#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {11001#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {11001#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {11001#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {11001#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {11001#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {11001#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {11001#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {11001#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {11001#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {11001#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {11001#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {11001#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {11001#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {11001#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {11001#false} assume 8448 == #t~mem68;havoc #t~mem68; {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {11001#false} assume !(~num1~0 > 0); {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {11001#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {11001#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {11001#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {11001#false} ~skip~0 := 0; {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {11001#false} assume !false; {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {11001#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {11001#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {11001#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {11001#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {11001#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {11001#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {11001#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {11001#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {11001#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {11001#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {11001#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {11001#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {11001#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {11001#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {11001#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {11001#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {11001#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {11001#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {11001#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {11001#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {11001#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {11001#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {11001#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {11001#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 82: Hoare triple {11001#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {11001#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {11001#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {11001#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 86: Hoare triple {11001#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 87: Hoare triple {11001#false} assume 8640 == #t~mem75;havoc #t~mem75; {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 88: Hoare triple {11001#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 89: Hoare triple {11001#false} assume !(9 == ~blastFlag~0); {11001#false} is VALID [2022-04-15 11:45:02,213 INFO L290 TraceCheckUtils]: 90: Hoare triple {11001#false} assume !false; {11001#false} is VALID [2022-04-15 11:45:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:45:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:02,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821266620] [2022-04-15 11:45:02,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821266620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:02,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:02,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:02,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:02,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050091193] [2022-04-15 11:45:02,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050091193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:02,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:02,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183467365] [2022-04-15 11:45:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:02,227 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 91 [2022-04-15 11:45:02,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:02,228 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-15 11:45:02,302 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-15 11:45:02,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:02,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:02,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:02,303 INFO L87 Difference]: Start difference. First operand 235 states and 380 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-15 11:45:04,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:08,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:09,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:10,589 INFO L93 Difference]: Finished difference Result 458 states and 743 transitions. [2022-04-15 11:45:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:10,589 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 91 [2022-04-15 11:45:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:10,589 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-15 11:45:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-15 11:45:10,591 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-15 11:45:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-15 11:45:10,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-15 11:45:10,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:10,879 INFO L225 Difference]: With dead ends: 458 [2022-04-15 11:45:10,879 INFO L226 Difference]: Without dead ends: 249 [2022-04-15 11:45:10,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:10,880 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 20 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:10,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 501 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 11:45:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-15 11:45:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 235. [2022-04-15 11:45:10,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:10,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 235 states, 230 states have (on average 1.6304347826086956) internal successors, (375), 230 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,888 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 235 states, 230 states have (on average 1.6304347826086956) internal successors, (375), 230 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,888 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 235 states, 230 states have (on average 1.6304347826086956) internal successors, (375), 230 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:10,892 INFO L93 Difference]: Finished difference Result 249 states and 397 transitions. [2022-04-15 11:45:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 397 transitions. [2022-04-15 11:45:10,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:10,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:10,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 230 states have (on average 1.6304347826086956) internal successors, (375), 230 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-15 11:45:10,894 INFO L87 Difference]: Start difference. First operand has 235 states, 230 states have (on average 1.6304347826086956) internal successors, (375), 230 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-15 11:45:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:10,898 INFO L93 Difference]: Finished difference Result 249 states and 397 transitions. [2022-04-15 11:45:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 397 transitions. [2022-04-15 11:45:10,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:10,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:10,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:10,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.6304347826086956) internal successors, (375), 230 states have internal predecessors, (375), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 379 transitions. [2022-04-15 11:45:10,904 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 379 transitions. Word has length 91 [2022-04-15 11:45:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:10,905 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 379 transitions. [2022-04-15 11:45:10,905 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 379 transitions. [2022-04-15 11:45:11,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 379 transitions. [2022-04-15 11:45:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:45:11,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:11,220 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-04-15 11:45:11,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:45:11,221 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:11,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2040904559, now seen corresponding path program 1 times [2022-04-15 11:45:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:11,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083993796] [2022-04-15 11:45:11,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:11,250 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:11,250 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:11,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2040904559, now seen corresponding path program 2 times [2022-04-15 11:45:11,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:11,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873657114] [2022-04-15 11:45:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:11,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:11,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {12903#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12896#true} is VALID [2022-04-15 11:45:11,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {12896#true} assume true; {12896#true} is VALID [2022-04-15 11:45:11,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12896#true} {12896#true} #705#return; {12896#true} is VALID [2022-04-15 11:45:11,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {12896#true} call ULTIMATE.init(); {12903#(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-15 11:45:11,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {12903#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12896#true} is VALID [2022-04-15 11:45:11,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#true} assume true; {12896#true} is VALID [2022-04-15 11:45:11,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#true} {12896#true} #705#return; {12896#true} is VALID [2022-04-15 11:45:11,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#true} call #t~ret161 := main(); {12896#true} is VALID [2022-04-15 11:45:11,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12896#true} is VALID [2022-04-15 11:45:11,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {12896#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12896#true} is VALID [2022-04-15 11:45:11,351 INFO L272 TraceCheckUtils]: 7: Hoare triple {12896#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12896#true} is VALID [2022-04-15 11:45:11,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {12896#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {12901#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12902#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {12902#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {12897#false} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {12897#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {12897#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {12897#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12897#false} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {12897#false} ~skip~0 := 0; {12897#false} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {12897#false} assume !false; {12897#false} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {12897#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {12897#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {12897#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {12897#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {12897#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {12897#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {12897#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {12897#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {12897#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {12897#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {12897#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {12897#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {12897#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {12897#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {12897#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {12897#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,359 INFO L290 TraceCheckUtils]: 45: Hoare triple {12897#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {12897#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {12897#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 48: Hoare triple {12897#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {12897#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {12897#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {12897#false} assume 8448 == #t~mem68;havoc #t~mem68; {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {12897#false} assume !(~num1~0 > 0); {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {12897#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {12897#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {12897#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {12897#false} ~skip~0 := 0; {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {12897#false} assume !false; {12897#false} is VALID [2022-04-15 11:45:11,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {12897#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {12897#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {12897#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {12897#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {12897#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {12897#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {12897#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {12897#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {12897#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 67: Hoare triple {12897#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 68: Hoare triple {12897#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {12897#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {12897#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 71: Hoare triple {12897#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,361 INFO L290 TraceCheckUtils]: 72: Hoare triple {12897#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {12897#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {12897#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {12897#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 76: Hoare triple {12897#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 77: Hoare triple {12897#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 78: Hoare triple {12897#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 79: Hoare triple {12897#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 80: Hoare triple {12897#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 81: Hoare triple {12897#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 82: Hoare triple {12897#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 83: Hoare triple {12897#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 84: Hoare triple {12897#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 85: Hoare triple {12897#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,362 INFO L290 TraceCheckUtils]: 86: Hoare triple {12897#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12897#false} is VALID [2022-04-15 11:45:11,363 INFO L290 TraceCheckUtils]: 87: Hoare triple {12897#false} assume 8640 == #t~mem75;havoc #t~mem75; {12897#false} is VALID [2022-04-15 11:45:11,363 INFO L290 TraceCheckUtils]: 88: Hoare triple {12897#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12897#false} is VALID [2022-04-15 11:45:11,363 INFO L290 TraceCheckUtils]: 89: Hoare triple {12897#false} assume !(9 == ~blastFlag~0); {12897#false} is VALID [2022-04-15 11:45:11,363 INFO L290 TraceCheckUtils]: 90: Hoare triple {12897#false} assume !false; {12897#false} is VALID [2022-04-15 11:45:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:45:11,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:11,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873657114] [2022-04-15 11:45:11,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873657114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:11,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:11,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:11,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:11,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083993796] [2022-04-15 11:45:11,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083993796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:11,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:11,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:11,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159739452] [2022-04-15 11:45:11,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:11,364 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 91 [2022-04-15 11:45:11,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:11,365 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-15 11:45:11,411 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-15 11:45:11,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:11,412 INFO L87 Difference]: Start difference. First operand 235 states and 379 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-15 11:45:15,416 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-15 11:45:19,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:21,122 INFO L93 Difference]: Finished difference Result 524 states and 838 transitions. [2022-04-15 11:45:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:21,122 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 91 [2022-04-15 11:45:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:21,123 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-15 11:45:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-15 11:45:21,142 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-15 11:45:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-15 11:45:21,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-15 11:45:21,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 606 edges. 606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:21,548 INFO L225 Difference]: With dead ends: 524 [2022-04-15 11:45:21,548 INFO L226 Difference]: Without dead ends: 315 [2022-04-15 11:45:21,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:21,549 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 147 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:21,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 372 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:45:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-15 11:45:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 235. [2022-04-15 11:45:21,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:21,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 235 states, 230 states have (on average 1.617391304347826) internal successors, (372), 230 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:21,556 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 235 states, 230 states have (on average 1.617391304347826) internal successors, (372), 230 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:21,557 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 235 states, 230 states have (on average 1.617391304347826) internal successors, (372), 230 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:21,562 INFO L93 Difference]: Finished difference Result 315 states and 490 transitions. [2022-04-15 11:45:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 490 transitions. [2022-04-15 11:45:21,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:21,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:21,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 230 states have (on average 1.617391304347826) internal successors, (372), 230 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-15 11:45:21,564 INFO L87 Difference]: Start difference. First operand has 235 states, 230 states have (on average 1.617391304347826) internal successors, (372), 230 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-15 11:45:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:21,570 INFO L93 Difference]: Finished difference Result 315 states and 490 transitions. [2022-04-15 11:45:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 490 transitions. [2022-04-15 11:45:21,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:21,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:21,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:21,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.617391304347826) internal successors, (372), 230 states have internal predecessors, (372), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 376 transitions. [2022-04-15 11:45:21,577 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 376 transitions. Word has length 91 [2022-04-15 11:45:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:21,577 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 376 transitions. [2022-04-15 11:45:21,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:21,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 376 transitions. [2022-04-15 11:45:21,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 376 transitions. [2022-04-15 11:45:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 11:45:21,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:21,842 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:21,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:45:21,842 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash 722842116, now seen corresponding path program 1 times [2022-04-15 11:45:21,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:21,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [606315377] [2022-04-15 11:45:21,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:45:21,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:21,983 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:21,983 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:45:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2032565962, now seen corresponding path program 1 times [2022-04-15 11:45:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:21,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027113281] [2022-04-15 11:45:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:22,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:22,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {15063#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15056#true} is VALID [2022-04-15 11:45:22,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {15056#true} assume true; {15056#true} is VALID [2022-04-15 11:45:22,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15056#true} {15056#true} #705#return; {15056#true} is VALID [2022-04-15 11:45:22,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {15056#true} call ULTIMATE.init(); {15063#(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-15 11:45:22,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {15063#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15056#true} is VALID [2022-04-15 11:45:22,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {15056#true} assume true; {15056#true} is VALID [2022-04-15 11:45:22,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15056#true} {15056#true} #705#return; {15056#true} is VALID [2022-04-15 11:45:22,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {15056#true} call #t~ret161 := main(); {15056#true} is VALID [2022-04-15 11:45:22,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {15056#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {15056#true} is VALID [2022-04-15 11:45:22,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {15056#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15056#true} is VALID [2022-04-15 11:45:22,120 INFO L272 TraceCheckUtils]: 7: Hoare triple {15056#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15056#true} is VALID [2022-04-15 11:45:22,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {15056#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [713] L1168-2-->L1169_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem151_32| |v_ssl3_accept_#t~mem151_28|)) (.cse1 (= |v_#memory_int_317| |v_#memory_int_310|)) (.cse2 (= |v_ssl3_accept_#t~mem85_19| |v_ssl3_accept_#t~mem85_17|)) (.cse3 (= |v_ssl3_accept_#t~mem48_31| |v_ssl3_accept_#t~mem48_27|)) (.cse4 (= |v_ssl3_accept_#t~mem82_19| |v_ssl3_accept_#t~mem82_17|)) (.cse5 (= |v_ssl3_accept_#t~mem89_11| |v_ssl3_accept_#t~mem89_10|)) (.cse6 (= |v_ssl3_accept_#t~mem49_22| |v_ssl3_accept_#t~mem49_18|)) (.cse7 (= |v_ssl3_accept_#t~mem46_18| |v_ssl3_accept_#t~mem46_16|)) (.cse8 (= v_ssl3_accept_~skip~0_28 v_ssl3_accept_~skip~0_26)) (.cse9 (= |v_ssl3_accept_#t~mem83.base_19| |v_ssl3_accept_#t~mem83.base_17|)) (.cse10 (= |v_ssl3_accept_#t~mem88.offset_11| |v_ssl3_accept_#t~mem88.offset_10|)) (.cse11 (= v_ssl3_accept_~state~0_20 v_ssl3_accept_~state~0_18))) (or (and .cse0 (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_11|) .cse1 (= |v_ssl3_accept_#t~mem83.offset_17| |v_ssl3_accept_#t~mem83.offset_19|) .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.base_26| |v_ssl3_accept_#t~mem150.base_30|) (= |v_#memory_$Pointer$.base_322| |v_#memory_$Pointer$.base_330|) .cse6 (= |v_ssl3_accept_#t~mem47_29| |v_ssl3_accept_#t~mem47_33|) .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem150.offset_26| |v_ssl3_accept_#t~mem150.offset_30|) (= |v_#memory_$Pointer$.offset_322| |v_#memory_$Pointer$.offset_330|) .cse11) (and .cse0 (= |v_#memory_$Pointer$.offset_330| |v_#memory_$Pointer$.offset_322|) (= |v_ssl3_accept_#t~mem47_33| |v_ssl3_accept_#t~mem47_29|) (= |v_#memory_$Pointer$.base_330| |v_#memory_$Pointer$.base_322|) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.base_30| |v_ssl3_accept_#t~mem150.base_26|) .cse6 (= |v_ssl3_accept_#t~mem150.offset_30| |v_ssl3_accept_#t~mem150.offset_26|) .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem83.offset_19| |v_ssl3_accept_#t~mem83.offset_17|) (= |v_ssl3_accept_#t~mem88.base_11| |v_ssl3_accept_#t~mem88.base_10|) .cse11))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_19|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_330|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_19|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_19|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_32|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_30|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_11|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_19|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_22|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_31|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_30|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_33|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_18|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_28, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_11|, #memory_int=|v_#memory_int_317|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_330|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_20} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_322|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_17|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_17|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_28|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_26|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_17|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_18|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_27|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_26|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_29|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_16|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_26, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_310|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_322|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_18} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [714] L1169_primed-->L1168-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [715] L1168-2-->L1169_primed: Formula: (or (let ((.cse0 (select |v_#memory_int_316| v_ssl3_accept_~s.base_112)) (.cse1 (+ 52 v_ssl3_accept_~s.offset_112))) (let ((.cse4 (select |v_#memory_$Pointer$.offset_329| v_ssl3_accept_~s.base_112)) (.cse2 (select |v_#memory_$Pointer$.base_329| v_ssl3_accept_~s.base_112)) (.cse7 (select |v_#memory_$Pointer$.base_328| v_ssl3_accept_~s.base_112)) (.cse6 (select |v_#memory_$Pointer$.offset_328| v_ssl3_accept_~s.base_112)) (.cse3 (+ 84 v_ssl3_accept_~s.offset_112)) (.cse5 (select .cse0 .cse1))) (and (not (< 0 v_ssl3_accept_~num1~0_10)) (= (store |v_#memory_int_316| v_ssl3_accept_~s.base_112 (store .cse0 .cse1 (select (select |v_#memory_int_316| (select .cse2 .cse3)) (+ (select .cse4 .cse3) 844)))) |v_#memory_int_315|) (not (= 16384 .cse5)) (= |v_#memory_$Pointer$.offset_328| (store |v_#memory_$Pointer$.offset_329| v_ssl3_accept_~s.base_112 (store .cse4 .cse1 (select .cse6 .cse1)))) (= 8448 .cse5) (= v_ssl3_accept_~skip~0_27 0) (not (= 8512 .cse5)) (not (= 8561 .cse5)) (not (= 8465 .cse5)) (not (= 12292 .cse5)) (= (store |v_#memory_$Pointer$.base_329| v_ssl3_accept_~s.base_112 (store .cse2 .cse1 (select .cse7 .cse1))) |v_#memory_$Pointer$.base_328|) (not (= 8480 .cse5)) (not (= 8529 .cse5)) (not (= 8544 .cse5)) (not (= 8192 .cse5)) (not (= 8497 .cse5)) (= v_ssl3_accept_~state~0_19 .cse5) (not (= 8482 .cse5)) (not (= 8560 .cse5)) (not (= 8464 .cse5)) (not (= 8513 .cse5)) (not (= 8466 .cse5)) (not (= (select (select |v_#memory_int_315| (select .cse7 .cse3)) (+ 848 (select .cse6 .cse3))) 0)) (not (= 8496 .cse5)) (not (= 8528 .cse5)) (not (= 8545 .cse5)) (not (= 8481 .cse5)) (not (= 24576 .cse5)) (not (= 8195 .cse5))))) (and (= |v_#memory_$Pointer$.base_329| |v_#memory_$Pointer$.base_328|) (= v_ssl3_accept_~s.base_112 v_ssl3_accept_~s.base_112) (= |v_#memory_int_316| |v_#memory_int_315|) (= |v_#memory_$Pointer$.offset_329| |v_#memory_$Pointer$.offset_328|) (= v_ssl3_accept_~s.offset_112 v_ssl3_accept_~s.offset_112) (= v_ssl3_accept_~num1~0_10 v_ssl3_accept_~num1~0_10))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_112, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_329|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_10, #memory_int=|v_#memory_int_316|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_112, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_329|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_328|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_10, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_30|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_18|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_18|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_18|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_28|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_27, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_16|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_14|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_12|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_6|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_12|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_12|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_6|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_12|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_12|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_112, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_12|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_12|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_12|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_6|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_28|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_20|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_29|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_31|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_17|, #memory_int=|v_#memory_int_315|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_12|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_12|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_12|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_12|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_12|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_112, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_328|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_19} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [712] L1169_primed-->L1169: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {15061#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15062#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {15062#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {15057#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {15057#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {15057#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {15057#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {15057#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {15057#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {15057#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {15057#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {15057#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {15057#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {15057#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {15057#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {15057#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {15057#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {15057#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {15057#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {15057#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {15057#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {15057#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {15057#false} assume 8640 == #t~mem75;havoc #t~mem75; {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {15057#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {15057#false} is VALID [2022-04-15 11:45:22,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {15057#false} assume !(9 == ~blastFlag~0); {15057#false} is VALID [2022-04-15 11:45:22,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {15057#false} assume !false; {15057#false} is VALID [2022-04-15 11:45:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:45:22,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:22,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027113281] [2022-04-15 11:45:22,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027113281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:22,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:22,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:22,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:22,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [606315377] [2022-04-15 11:45:22,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [606315377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:22,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:22,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:45:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672538094] [2022-04-15 11:45:22,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:22,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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 92 [2022-04-15 11:45:22,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:22,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-15 11:45:22,270 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-15 11:45:22,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:45:22,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:22,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:45:22,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:45:22,271 INFO L87 Difference]: Start difference. First operand 235 states and 376 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-15 11:45:25,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:27,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:29,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:30,724 INFO L93 Difference]: Finished difference Result 457 states and 736 transitions. [2022-04-15 11:45:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:45:30,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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 92 [2022-04-15 11:45:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-15 11:45:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 450 transitions. [2022-04-15 11:45:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-15 11:45:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 450 transitions. [2022-04-15 11:45:30,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 450 transitions. [2022-04-15 11:45:31,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:31,024 INFO L225 Difference]: With dead ends: 457 [2022-04-15 11:45:31,024 INFO L226 Difference]: Without dead ends: 248 [2022-04-15 11:45:31,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:45:31,025 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 16 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:31,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 552 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 417 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 11:45:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-15 11:45:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 235. [2022-04-15 11:45:31,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:31,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 235 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 230 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,035 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 235 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 230 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,035 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 235 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 230 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:31,062 INFO L93 Difference]: Finished difference Result 248 states and 392 transitions. [2022-04-15 11:45:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 392 transitions. [2022-04-15 11:45:31,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:31,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:31,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 230 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-15 11:45:31,064 INFO L87 Difference]: Start difference. First operand has 235 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 230 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-15 11:45:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:31,068 INFO L93 Difference]: Finished difference Result 248 states and 392 transitions. [2022-04-15 11:45:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 392 transitions. [2022-04-15 11:45:31,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:31,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:31,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:31,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 230 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 375 transitions. [2022-04-15 11:45:31,074 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 375 transitions. Word has length 92 [2022-04-15 11:45:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:31,075 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 375 transitions. [2022-04-15 11:45:31,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 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-15 11:45:31,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 375 transitions. [2022-04-15 11:45:31,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 375 transitions. [2022-04-15 11:45:31,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 11:45:31,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:31,338 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:31,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:45:31,339 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 154015300, now seen corresponding path program 1 times [2022-04-15 11:45:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:31,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637777890] [2022-04-15 11:45:31,378 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:31,379 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:31,379 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash 154015300, now seen corresponding path program 2 times [2022-04-15 11:45:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:31,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123388849] [2022-04-15 11:45:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:31,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {16958#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16951#true} is VALID [2022-04-15 11:45:31,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {16951#true} assume true; {16951#true} is VALID [2022-04-15 11:45:31,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16951#true} {16951#true} #705#return; {16951#true} is VALID [2022-04-15 11:45:31,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {16951#true} call ULTIMATE.init(); {16958#(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-15 11:45:31,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {16958#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16951#true} is VALID [2022-04-15 11:45:31,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {16951#true} assume true; {16951#true} is VALID [2022-04-15 11:45:31,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16951#true} {16951#true} #705#return; {16951#true} is VALID [2022-04-15 11:45:31,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {16951#true} call #t~ret161 := main(); {16951#true} is VALID [2022-04-15 11:45:31,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {16951#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16951#true} is VALID [2022-04-15 11:45:31,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {16951#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16951#true} is VALID [2022-04-15 11:45:31,481 INFO L272 TraceCheckUtils]: 7: Hoare triple {16951#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16951#true} is VALID [2022-04-15 11:45:31,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {16951#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:31,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {16956#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16957#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-15 11:45:31,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {16957#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {16952#false} is VALID [2022-04-15 11:45:31,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {16952#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {16952#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16952#false} is VALID [2022-04-15 11:45:31,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {16952#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {16952#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {16952#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16952#false} is VALID [2022-04-15 11:45:31,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {16952#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {16952#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {16952#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {16952#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {16952#false} ~skip~0 := 0; {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {16952#false} assume !false; {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {16952#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {16952#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {16952#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {16952#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {16952#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {16952#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {16952#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {16952#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {16952#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {16952#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {16952#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {16952#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {16952#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {16952#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {16952#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {16952#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {16952#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {16952#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {16952#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {16952#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 51: Hoare triple {16952#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {16952#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {16952#false} assume 8448 == #t~mem68;havoc #t~mem68; {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {16952#false} assume !(~num1~0 > 0); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 55: Hoare triple {16952#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {16952#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {16952#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 58: Hoare triple {16952#false} ~skip~0 := 0; {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {16952#false} assume !false; {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {16952#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {16952#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {16952#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {16952#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {16952#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {16952#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {16952#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 67: Hoare triple {16952#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 68: Hoare triple {16952#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 69: Hoare triple {16952#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 70: Hoare triple {16952#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 71: Hoare triple {16952#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {16952#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {16952#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 74: Hoare triple {16952#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 75: Hoare triple {16952#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 76: Hoare triple {16952#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 77: Hoare triple {16952#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 78: Hoare triple {16952#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,491 INFO L290 TraceCheckUtils]: 79: Hoare triple {16952#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 80: Hoare triple {16952#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 81: Hoare triple {16952#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 82: Hoare triple {16952#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {16952#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 84: Hoare triple {16952#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 85: Hoare triple {16952#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 86: Hoare triple {16952#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 87: Hoare triple {16952#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 88: Hoare triple {16952#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 89: Hoare triple {16952#false} assume 8640 == #t~mem75;havoc #t~mem75; {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 90: Hoare triple {16952#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 91: Hoare triple {16952#false} assume !(9 == ~blastFlag~0); {16952#false} is VALID [2022-04-15 11:45:31,492 INFO L290 TraceCheckUtils]: 92: Hoare triple {16952#false} assume !false; {16952#false} is VALID [2022-04-15 11:45:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:45:31,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123388849] [2022-04-15 11:45:31,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123388849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:31,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:31,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:31,493 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637777890] [2022-04-15 11:45:31,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637777890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:31,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:31,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:31,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129918849] [2022-04-15 11:45:31,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:31,494 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 93 [2022-04-15 11:45:31,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:31,494 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-15 11:45:31,540 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-15 11:45:31,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:31,541 INFO L87 Difference]: Start difference. First operand 235 states and 375 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-15 11:45:35,205 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-15 11:45:37,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:41,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:42,700 INFO L93 Difference]: Finished difference Result 457 states and 735 transitions. [2022-04-15 11:45:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:42,700 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 93 [2022-04-15 11:45:42,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:42,700 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-15 11:45:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-15 11:45:42,703 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-15 11:45:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-15 11:45:42,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-15 11:45:42,991 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-15 11:45:42,994 INFO L225 Difference]: With dead ends: 457 [2022-04-15 11:45:42,994 INFO L226 Difference]: Without dead ends: 248 [2022-04-15 11:45:42,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:42,995 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 20 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:42,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 503 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 11:45:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-15 11:45:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 235. [2022-04-15 11:45:43,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:43,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 235 states, 230 states have (on average 1.608695652173913) internal successors, (370), 230 states have internal predecessors, (370), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:43,003 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 235 states, 230 states have (on average 1.608695652173913) internal successors, (370), 230 states have internal predecessors, (370), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:43,003 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 235 states, 230 states have (on average 1.608695652173913) internal successors, (370), 230 states have internal predecessors, (370), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:43,007 INFO L93 Difference]: Finished difference Result 248 states and 391 transitions. [2022-04-15 11:45:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 391 transitions. [2022-04-15 11:45:43,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:43,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:43,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 230 states have (on average 1.608695652173913) internal successors, (370), 230 states have internal predecessors, (370), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-15 11:45:43,008 INFO L87 Difference]: Start difference. First operand has 235 states, 230 states have (on average 1.608695652173913) internal successors, (370), 230 states have internal predecessors, (370), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-15 11:45:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:43,012 INFO L93 Difference]: Finished difference Result 248 states and 391 transitions. [2022-04-15 11:45:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 391 transitions. [2022-04-15 11:45:43,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:43,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:43,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:43,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.608695652173913) internal successors, (370), 230 states have internal predecessors, (370), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 374 transitions. [2022-04-15 11:45:43,018 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 374 transitions. Word has length 93 [2022-04-15 11:45:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:43,018 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 374 transitions. [2022-04-15 11:45:43,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:43,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 374 transitions. [2022-04-15 11:45:43,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 374 transitions. [2022-04-15 11:45:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 11:45:43,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:43,292 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:43,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:45:43,292 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1918310303, now seen corresponding path program 1 times [2022-04-15 11:45:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:43,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1407078420] [2022-04-15 11:45:43,337 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:43,338 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:43,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1918310303, now seen corresponding path program 2 times [2022-04-15 11:45:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:43,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118874623] [2022-04-15 11:45:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:43,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:43,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {18850#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18843#true} is VALID [2022-04-15 11:45:43,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {18843#true} assume true; {18843#true} is VALID [2022-04-15 11:45:43,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18843#true} {18843#true} #705#return; {18843#true} is VALID [2022-04-15 11:45:43,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {18843#true} call ULTIMATE.init(); {18850#(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-15 11:45:43,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {18850#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18843#true} is VALID [2022-04-15 11:45:43,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {18843#true} assume true; {18843#true} is VALID [2022-04-15 11:45:43,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18843#true} {18843#true} #705#return; {18843#true} is VALID [2022-04-15 11:45:43,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {18843#true} call #t~ret161 := main(); {18843#true} is VALID [2022-04-15 11:45:43,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {18843#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18843#true} is VALID [2022-04-15 11:45:43,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {18843#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18843#true} is VALID [2022-04-15 11:45:43,443 INFO L272 TraceCheckUtils]: 7: Hoare triple {18843#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18843#true} is VALID [2022-04-15 11:45:43,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {18843#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:43,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {18848#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18849#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {18849#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {18844#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {18844#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {18844#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {18844#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {18844#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {18844#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {18844#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {18844#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {18844#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18844#false} is VALID [2022-04-15 11:45:43,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {18844#false} ~skip~0 := 0; {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {18844#false} assume !false; {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {18844#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {18844#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {18844#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {18844#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {18844#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {18844#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {18844#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {18844#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {18844#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {18844#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {18844#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {18844#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {18844#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {18844#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {18844#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {18844#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {18844#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {18844#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {18844#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {18844#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {18844#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {18844#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {18844#false} assume 8448 == #t~mem68;havoc #t~mem68; {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {18844#false} assume !(~num1~0 > 0); {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {18844#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {18844#false} is VALID [2022-04-15 11:45:43,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {18844#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {18844#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {18844#false} ~skip~0 := 0; {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {18844#false} assume !false; {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {18844#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {18844#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {18844#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {18844#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {18844#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {18844#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 67: Hoare triple {18844#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 68: Hoare triple {18844#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {18844#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {18844#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {18844#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {18844#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {18844#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {18844#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {18844#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {18844#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {18844#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {18844#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 79: Hoare triple {18844#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 80: Hoare triple {18844#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 81: Hoare triple {18844#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 82: Hoare triple {18844#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 83: Hoare triple {18844#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,454 INFO L290 TraceCheckUtils]: 84: Hoare triple {18844#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {18844#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {18844#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,455 INFO L290 TraceCheckUtils]: 87: Hoare triple {18844#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,455 INFO L290 TraceCheckUtils]: 88: Hoare triple {18844#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,455 INFO L290 TraceCheckUtils]: 89: Hoare triple {18844#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18844#false} is VALID [2022-04-15 11:45:43,455 INFO L290 TraceCheckUtils]: 90: Hoare triple {18844#false} assume 8640 == #t~mem75;havoc #t~mem75; {18844#false} is VALID [2022-04-15 11:45:43,461 INFO L290 TraceCheckUtils]: 91: Hoare triple {18844#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18844#false} is VALID [2022-04-15 11:45:43,461 INFO L290 TraceCheckUtils]: 92: Hoare triple {18844#false} assume !(9 == ~blastFlag~0); {18844#false} is VALID [2022-04-15 11:45:43,461 INFO L290 TraceCheckUtils]: 93: Hoare triple {18844#false} assume !false; {18844#false} is VALID [2022-04-15 11:45:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:45:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118874623] [2022-04-15 11:45:43,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118874623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:43,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:43,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:43,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:43,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1407078420] [2022-04-15 11:45:43,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1407078420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:43,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:43,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589168799] [2022-04-15 11:45:43,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:43,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:45:43,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:43,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:43,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:43,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:43,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:43,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:43,517 INFO L87 Difference]: Start difference. First operand 235 states and 374 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:45,715 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-15 11:45:48,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:50,762 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-15 11:45:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:52,061 INFO L93 Difference]: Finished difference Result 524 states and 831 transitions. [2022-04-15 11:45:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:52,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:45:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-15 11:45:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-15 11:45:52,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 605 transitions. [2022-04-15 11:45:52,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 605 edges. 605 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:52,414 INFO L225 Difference]: With dead ends: 524 [2022-04-15 11:45:52,414 INFO L226 Difference]: Without dead ends: 315 [2022-04-15 11:45:52,415 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:52,415 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 149 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:52,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 372 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 485 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-04-15 11:45:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-15 11:45:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 235. [2022-04-15 11:45:52,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:52,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 235 states, 230 states have (on average 1.5956521739130434) internal successors, (367), 230 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:52,422 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 235 states, 230 states have (on average 1.5956521739130434) internal successors, (367), 230 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:52,423 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 235 states, 230 states have (on average 1.5956521739130434) internal successors, (367), 230 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:52,428 INFO L93 Difference]: Finished difference Result 315 states and 485 transitions. [2022-04-15 11:45:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 485 transitions. [2022-04-15 11:45:52,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:52,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:52,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 230 states have (on average 1.5956521739130434) internal successors, (367), 230 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-15 11:45:52,429 INFO L87 Difference]: Start difference. First operand has 235 states, 230 states have (on average 1.5956521739130434) internal successors, (367), 230 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-15 11:45:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:52,434 INFO L93 Difference]: Finished difference Result 315 states and 485 transitions. [2022-04-15 11:45:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 485 transitions. [2022-04-15 11:45:52,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:52,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:52,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:52,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.5956521739130434) internal successors, (367), 230 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 371 transitions. [2022-04-15 11:45:52,440 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 371 transitions. Word has length 94 [2022-04-15 11:45:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:52,440 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 371 transitions. [2022-04-15 11:45:52,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:52,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 371 transitions. [2022-04-15 11:45:52,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 371 transitions. [2022-04-15 11:45:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 11:45:52,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:52,731 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-04-15 11:45:52,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:45:52,732 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash -917845546, now seen corresponding path program 1 times [2022-04-15 11:45:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [180929573] [2022-04-15 11:45:52,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:52,771 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:52,771 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash -917845546, now seen corresponding path program 2 times [2022-04-15 11:45:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:52,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706132013] [2022-04-15 11:45:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:52,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:52,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {21010#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21003#true} is VALID [2022-04-15 11:45:52,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {21003#true} assume true; {21003#true} is VALID [2022-04-15 11:45:52,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21003#true} {21003#true} #705#return; {21003#true} is VALID [2022-04-15 11:45:52,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {21003#true} call ULTIMATE.init(); {21010#(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-15 11:45:52,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {21010#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21003#true} is VALID [2022-04-15 11:45:52,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {21003#true} assume true; {21003#true} is VALID [2022-04-15 11:45:52,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21003#true} {21003#true} #705#return; {21003#true} is VALID [2022-04-15 11:45:52,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {21003#true} call #t~ret161 := main(); {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {21003#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {21003#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L272 TraceCheckUtils]: 7: Hoare triple {21003#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {21003#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {21003#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {21003#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {21003#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {21003#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {21003#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {21003#true} assume !false; {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {21003#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {21003#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {21003#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {21003#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {21003#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {21003#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {21003#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {21003#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {21003#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {21003#true} assume 8464 == #t~mem55;havoc #t~mem55; {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {21003#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21003#true} is VALID [2022-04-15 11:45:52,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {21003#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21003#true} is VALID [2022-04-15 11:45:52,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {21003#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,878 INFO L290 TraceCheckUtils]: 46: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:52,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {21008#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21009#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-15 11:45:52,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {21009#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {21004#false} is VALID [2022-04-15 11:45:52,881 INFO L290 TraceCheckUtils]: 55: Hoare triple {21004#false} assume !(~num1~0 > 0); {21004#false} is VALID [2022-04-15 11:45:52,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {21004#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {21004#false} is VALID [2022-04-15 11:45:52,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {21004#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {21004#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {21004#false} ~skip~0 := 0; {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {21004#false} assume !false; {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {21004#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {21004#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {21004#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {21004#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 65: Hoare triple {21004#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 66: Hoare triple {21004#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 67: Hoare triple {21004#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {21004#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {21004#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {21004#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {21004#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 72: Hoare triple {21004#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 73: Hoare triple {21004#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 74: Hoare triple {21004#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 75: Hoare triple {21004#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 76: Hoare triple {21004#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 77: Hoare triple {21004#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 78: Hoare triple {21004#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 79: Hoare triple {21004#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 80: Hoare triple {21004#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 81: Hoare triple {21004#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 82: Hoare triple {21004#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 83: Hoare triple {21004#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,883 INFO L290 TraceCheckUtils]: 84: Hoare triple {21004#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 85: Hoare triple {21004#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 86: Hoare triple {21004#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 87: Hoare triple {21004#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 88: Hoare triple {21004#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 89: Hoare triple {21004#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 90: Hoare triple {21004#false} assume 8640 == #t~mem75;havoc #t~mem75; {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 91: Hoare triple {21004#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 92: Hoare triple {21004#false} assume !(9 == ~blastFlag~0); {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L290 TraceCheckUtils]: 93: Hoare triple {21004#false} assume !false; {21004#false} is VALID [2022-04-15 11:45:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:52,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:52,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706132013] [2022-04-15 11:45:52,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706132013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:52,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:52,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:52,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:52,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [180929573] [2022-04-15 11:45:52,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [180929573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:52,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:52,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732436534] [2022-04-15 11:45:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:52,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:45:52,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:52,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:52,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:52,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:52,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:52,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:52,950 INFO L87 Difference]: Start difference. First operand 235 states and 371 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:56,548 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-15 11:46:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:04,141 INFO L93 Difference]: Finished difference Result 600 states and 962 transitions. [2022-04-15 11:46:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:46:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2022-04-15 11:46:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2022-04-15 11:46:04,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 600 transitions. [2022-04-15 11:46:04,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:04,511 INFO L225 Difference]: With dead ends: 600 [2022-04-15 11:46:04,511 INFO L226 Difference]: Without dead ends: 391 [2022-04-15 11:46:04,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:04,512 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 131 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:04,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 368 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 11:46:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-15 11:46:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 299. [2022-04-15 11:46:04,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:04,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:04,523 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:04,526 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:04,535 INFO L93 Difference]: Finished difference Result 391 states and 619 transitions. [2022-04-15 11:46:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 619 transitions. [2022-04-15 11:46:04,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:04,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:04,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 391 states. [2022-04-15 11:46:04,536 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 391 states. [2022-04-15 11:46:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:04,544 INFO L93 Difference]: Finished difference Result 391 states and 619 transitions. [2022-04-15 11:46:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 619 transitions. [2022-04-15 11:46:04,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:04,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:04,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:04,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 481 transitions. [2022-04-15 11:46:04,552 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 481 transitions. Word has length 94 [2022-04-15 11:46:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:04,552 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 481 transitions. [2022-04-15 11:46:04,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:04,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 481 transitions. [2022-04-15 11:46:04,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 481 transitions. [2022-04-15 11:46:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 11:46:04,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:04,900 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:04,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:46:04,900 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:04,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:04,901 INFO L85 PathProgramCache]: Analyzing trace with hash -562378976, now seen corresponding path program 1 times [2022-04-15 11:46:04,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:04,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [278361792] [2022-04-15 11:46:04,945 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:04,945 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:04,945 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash -562378976, now seen corresponding path program 2 times [2022-04-15 11:46:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:04,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723251705] [2022-04-15 11:46:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:05,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {23602#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23595#true} is VALID [2022-04-15 11:46:05,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-15 11:46:05,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23595#true} {23595#true} #705#return; {23595#true} is VALID [2022-04-15 11:46:05,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {23595#true} call ULTIMATE.init(); {23602#(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-15 11:46:05,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {23602#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23595#true} is VALID [2022-04-15 11:46:05,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {23595#true} assume true; {23595#true} is VALID [2022-04-15 11:46:05,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23595#true} {23595#true} #705#return; {23595#true} is VALID [2022-04-15 11:46:05,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {23595#true} call #t~ret161 := main(); {23595#true} is VALID [2022-04-15 11:46:05,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {23595#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23595#true} is VALID [2022-04-15 11:46:05,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {23595#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,062 INFO L272 TraceCheckUtils]: 7: Hoare triple {23595#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {23595#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {23595#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {23595#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {23595#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {23595#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {23595#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {23595#true} assume !false; {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {23595#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {23595#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {23595#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {23595#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {23595#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {23595#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {23595#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {23595#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {23595#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23595#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {23595#true} assume 8464 == #t~mem55;havoc #t~mem55; {23595#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {23595#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {23595#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {23595#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23595#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {23595#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {23600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23601#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {23601#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {23596#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {23596#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {23596#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {23596#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {23596#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {23596#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {23596#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {23596#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {23596#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {23596#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {23596#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {23596#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {23596#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {23596#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {23596#false} assume 8608 == #t~mem73;havoc #t~mem73; {23596#false} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {23596#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {23596#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {23596#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 63: Hoare triple {23596#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {23596#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {23596#false} ~skip~0 := 0; {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {23596#false} assume !false; {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 67: Hoare triple {23596#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {23596#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {23596#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {23596#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 71: Hoare triple {23596#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 72: Hoare triple {23596#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 73: Hoare triple {23596#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 74: Hoare triple {23596#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 75: Hoare triple {23596#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 76: Hoare triple {23596#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 77: Hoare triple {23596#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 78: Hoare triple {23596#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 79: Hoare triple {23596#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 80: Hoare triple {23596#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 81: Hoare triple {23596#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 82: Hoare triple {23596#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 83: Hoare triple {23596#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 84: Hoare triple {23596#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 85: Hoare triple {23596#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 86: Hoare triple {23596#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 87: Hoare triple {23596#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 88: Hoare triple {23596#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 89: Hoare triple {23596#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 90: Hoare triple {23596#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 91: Hoare triple {23596#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 92: Hoare triple {23596#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 93: Hoare triple {23596#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 94: Hoare triple {23596#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 95: Hoare triple {23596#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 96: Hoare triple {23596#false} assume 8640 == #t~mem75;havoc #t~mem75; {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 97: Hoare triple {23596#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 98: Hoare triple {23596#false} assume !(9 == ~blastFlag~0); {23596#false} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 99: Hoare triple {23596#false} assume !false; {23596#false} is VALID [2022-04-15 11:46:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 11:46:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:05,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723251705] [2022-04-15 11:46:05,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723251705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:05,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:05,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:05,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:05,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [278361792] [2022-04-15 11:46:05,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [278361792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:05,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:05,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143428795] [2022-04-15 11:46:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-15 11:46:05,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:05,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:05,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:05,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:05,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:05,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:05,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:05,135 INFO L87 Difference]: Start difference. First operand 299 states and 481 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:11,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:12,330 INFO L93 Difference]: Finished difference Result 614 states and 994 transitions. [2022-04-15 11:46:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:12,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-15 11:46:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-15 11:46:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-15 11:46:12,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 481 transitions. [2022-04-15 11:46:12,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:12,658 INFO L225 Difference]: With dead ends: 614 [2022-04-15 11:46:12,659 INFO L226 Difference]: Without dead ends: 341 [2022-04-15 11:46:12,659 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:12,659 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:12,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 517 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 399 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:46:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-04-15 11:46:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 321. [2022-04-15 11:46:12,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:12,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 321 states, 316 states have (on average 1.620253164556962) internal successors, (512), 316 states have internal predecessors, (512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:12,670 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 321 states, 316 states have (on average 1.620253164556962) internal successors, (512), 316 states have internal predecessors, (512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:12,670 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 321 states, 316 states have (on average 1.620253164556962) internal successors, (512), 316 states have internal predecessors, (512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:12,677 INFO L93 Difference]: Finished difference Result 341 states and 542 transitions. [2022-04-15 11:46:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 542 transitions. [2022-04-15 11:46:12,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:12,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:12,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 316 states have (on average 1.620253164556962) internal successors, (512), 316 states have internal predecessors, (512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 341 states. [2022-04-15 11:46:12,678 INFO L87 Difference]: Start difference. First operand has 321 states, 316 states have (on average 1.620253164556962) internal successors, (512), 316 states have internal predecessors, (512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 341 states. [2022-04-15 11:46:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:12,684 INFO L93 Difference]: Finished difference Result 341 states and 542 transitions. [2022-04-15 11:46:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 542 transitions. [2022-04-15 11:46:12,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:12,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:12,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:12,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 316 states have (on average 1.620253164556962) internal successors, (512), 316 states have internal predecessors, (512), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 516 transitions. [2022-04-15 11:46:12,694 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 516 transitions. Word has length 100 [2022-04-15 11:46:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:12,694 INFO L478 AbstractCegarLoop]: Abstraction has 321 states and 516 transitions. [2022-04-15 11:46:12,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:12,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 516 transitions. [2022-04-15 11:46:13,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 516 edges. 516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 516 transitions. [2022-04-15 11:46:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 11:46:13,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:13,046 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:13,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:46:13,046 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1390114174, now seen corresponding path program 1 times [2022-04-15 11:46:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:13,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1925091943] [2022-04-15 11:46:13,114 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:13,114 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:13,114 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1390114174, now seen corresponding path program 2 times [2022-04-15 11:46:13,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:13,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144752685] [2022-04-15 11:46:13,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:13,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {26166#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26159#true} is VALID [2022-04-15 11:46:13,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {26159#true} assume true; {26159#true} is VALID [2022-04-15 11:46:13,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26159#true} {26159#true} #705#return; {26159#true} is VALID [2022-04-15 11:46:13,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {26159#true} call ULTIMATE.init(); {26166#(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-15 11:46:13,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {26166#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26159#true} is VALID [2022-04-15 11:46:13,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {26159#true} assume true; {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26159#true} {26159#true} #705#return; {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {26159#true} call #t~ret161 := main(); {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {26159#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {26159#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L272 TraceCheckUtils]: 7: Hoare triple {26159#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {26159#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {26159#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {26159#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {26159#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {26159#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {26159#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {26159#true} assume !false; {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {26159#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {26159#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {26159#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {26159#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {26159#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {26159#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {26159#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {26159#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {26159#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {26159#true} assume 8464 == #t~mem55;havoc #t~mem55; {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {26159#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {26159#true} is VALID [2022-04-15 11:46:13,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {26159#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26159#true} is VALID [2022-04-15 11:46:13,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {26159#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:13,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {26164#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26165#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-15 11:46:13,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {26165#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {26160#false} is VALID [2022-04-15 11:46:13,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {26160#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {26160#false} is VALID [2022-04-15 11:46:13,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {26160#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {26160#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {26160#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {26160#false} ~skip~0 := 0; {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {26160#false} assume !false; {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {26160#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {26160#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {26160#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {26160#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {26160#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {26160#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 51: Hoare triple {26160#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {26160#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {26160#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {26160#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {26160#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {26160#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {26160#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {26160#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {26160#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {26160#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {26160#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {26160#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {26160#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {26160#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {26160#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {26160#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 67: Hoare triple {26160#false} assume 8448 == #t~mem68;havoc #t~mem68; {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 68: Hoare triple {26160#false} assume !(~num1~0 > 0); {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {26160#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {26160#false} is VALID [2022-04-15 11:46:13,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {26160#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 71: Hoare triple {26160#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 72: Hoare triple {26160#false} ~skip~0 := 0; {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 73: Hoare triple {26160#false} assume !false; {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 74: Hoare triple {26160#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 75: Hoare triple {26160#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 76: Hoare triple {26160#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {26160#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {26160#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {26160#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 80: Hoare triple {26160#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {26160#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {26160#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,228 INFO L290 TraceCheckUtils]: 83: Hoare triple {26160#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {26160#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 85: Hoare triple {26160#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 86: Hoare triple {26160#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 87: Hoare triple {26160#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 88: Hoare triple {26160#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 89: Hoare triple {26160#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 90: Hoare triple {26160#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {26160#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 92: Hoare triple {26160#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 93: Hoare triple {26160#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 94: Hoare triple {26160#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 95: Hoare triple {26160#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 96: Hoare triple {26160#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,229 INFO L290 TraceCheckUtils]: 97: Hoare triple {26160#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 98: Hoare triple {26160#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 99: Hoare triple {26160#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 100: Hoare triple {26160#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 101: Hoare triple {26160#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 102: Hoare triple {26160#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 103: Hoare triple {26160#false} assume 8640 == #t~mem75;havoc #t~mem75; {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 104: Hoare triple {26160#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 105: Hoare triple {26160#false} assume !(9 == ~blastFlag~0); {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L290 TraceCheckUtils]: 106: Hoare triple {26160#false} assume !false; {26160#false} is VALID [2022-04-15 11:46:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:46:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:13,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144752685] [2022-04-15 11:46:13,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144752685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:13,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:13,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:13,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:13,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1925091943] [2022-04-15 11:46:13,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1925091943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:13,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:13,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673769750] [2022-04-15 11:46:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:13,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2022-04-15 11:46:13,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:13,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:13,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:13,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:13,313 INFO L87 Difference]: Start difference. First operand 321 states and 516 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:14,906 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-15 11:46:16,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:18,936 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-15 11:46:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:21,536 INFO L93 Difference]: Finished difference Result 636 states and 1028 transitions. [2022-04-15 11:46:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:21,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2022-04-15 11:46:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:46:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:46:21,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-15 11:46:21,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:21,859 INFO L225 Difference]: With dead ends: 636 [2022-04-15 11:46:21,859 INFO L226 Difference]: Without dead ends: 341 [2022-04-15 11:46:21,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:21,860 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 36 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:21,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 517 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 397 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 11:46:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-04-15 11:46:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 321. [2022-04-15 11:46:21,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:21,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 321 states, 316 states have (on average 1.6170886075949367) internal successors, (511), 316 states have internal predecessors, (511), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:21,871 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 321 states, 316 states have (on average 1.6170886075949367) internal successors, (511), 316 states have internal predecessors, (511), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:21,871 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 321 states, 316 states have (on average 1.6170886075949367) internal successors, (511), 316 states have internal predecessors, (511), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:21,877 INFO L93 Difference]: Finished difference Result 341 states and 541 transitions. [2022-04-15 11:46:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 541 transitions. [2022-04-15 11:46:21,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:21,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:21,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 316 states have (on average 1.6170886075949367) internal successors, (511), 316 states have internal predecessors, (511), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 341 states. [2022-04-15 11:46:21,878 INFO L87 Difference]: Start difference. First operand has 321 states, 316 states have (on average 1.6170886075949367) internal successors, (511), 316 states have internal predecessors, (511), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 341 states. [2022-04-15 11:46:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:21,884 INFO L93 Difference]: Finished difference Result 341 states and 541 transitions. [2022-04-15 11:46:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 541 transitions. [2022-04-15 11:46:21,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:21,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:21,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:21,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 316 states have (on average 1.6170886075949367) internal successors, (511), 316 states have internal predecessors, (511), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 515 transitions. [2022-04-15 11:46:21,893 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 515 transitions. Word has length 107 [2022-04-15 11:46:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:21,893 INFO L478 AbstractCegarLoop]: Abstraction has 321 states and 515 transitions. [2022-04-15 11:46:21,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:21,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 515 transitions. [2022-04-15 11:46:22,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 515 transitions. [2022-04-15 11:46:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 11:46:22,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:22,289 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:22,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:46:22,289 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:22,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1997888097, now seen corresponding path program 1 times [2022-04-15 11:46:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:22,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894130022] [2022-04-15 11:46:22,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:22,345 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:22,345 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1997888097, now seen corresponding path program 2 times [2022-04-15 11:46:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:22,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759791965] [2022-04-15 11:46:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:22,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:22,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:22,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {28774#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28767#true} is VALID [2022-04-15 11:46:22,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {28767#true} assume true; {28767#true} is VALID [2022-04-15 11:46:22,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28767#true} {28767#true} #705#return; {28767#true} is VALID [2022-04-15 11:46:22,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {28767#true} call ULTIMATE.init(); {28774#(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-15 11:46:22,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {28774#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28767#true} is VALID [2022-04-15 11:46:22,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {28767#true} assume true; {28767#true} is VALID [2022-04-15 11:46:22,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28767#true} {28767#true} #705#return; {28767#true} is VALID [2022-04-15 11:46:22,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {28767#true} call #t~ret161 := main(); {28767#true} is VALID [2022-04-15 11:46:22,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {28767#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {28767#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L272 TraceCheckUtils]: 7: Hoare triple {28767#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {28767#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {28767#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {28767#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {28767#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {28767#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {28767#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {28767#true} assume !false; {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {28767#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {28767#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {28767#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {28767#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {28767#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {28767#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {28767#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {28767#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {28767#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28767#true} is VALID [2022-04-15 11:46:22,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {28767#true} assume 8464 == #t~mem55;havoc #t~mem55; {28767#true} is VALID [2022-04-15 11:46:22,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {28767#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {28767#true} is VALID [2022-04-15 11:46:22,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {28767#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28767#true} is VALID [2022-04-15 11:46:22,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {28767#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {28772#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28773#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {28773#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {28768#false} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {28768#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {28768#false} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {28768#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {28768#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {28768#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28768#false} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {28768#false} ~skip~0 := 0; {28768#false} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {28768#false} assume !false; {28768#false} is VALID [2022-04-15 11:46:22,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {28768#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {28768#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {28768#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {28768#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {28768#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {28768#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {28768#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {28768#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {28768#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {28768#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {28768#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {28768#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 58: Hoare triple {28768#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 59: Hoare triple {28768#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {28768#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {28768#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {28768#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {28768#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {28768#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {28768#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {28768#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 67: Hoare triple {28768#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 68: Hoare triple {28768#false} assume 8448 == #t~mem68;havoc #t~mem68; {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {28768#false} assume !(~num1~0 > 0); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {28768#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 71: Hoare triple {28768#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 72: Hoare triple {28768#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28768#false} is VALID [2022-04-15 11:46:22,453 INFO L290 TraceCheckUtils]: 73: Hoare triple {28768#false} ~skip~0 := 0; {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {28768#false} assume !false; {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {28768#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {28768#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {28768#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {28768#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 79: Hoare triple {28768#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 80: Hoare triple {28768#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 81: Hoare triple {28768#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 82: Hoare triple {28768#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 83: Hoare triple {28768#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 84: Hoare triple {28768#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 85: Hoare triple {28768#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 86: Hoare triple {28768#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,454 INFO L290 TraceCheckUtils]: 87: Hoare triple {28768#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 88: Hoare triple {28768#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 89: Hoare triple {28768#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 90: Hoare triple {28768#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 91: Hoare triple {28768#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 92: Hoare triple {28768#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 93: Hoare triple {28768#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 94: Hoare triple {28768#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 95: Hoare triple {28768#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 96: Hoare triple {28768#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 97: Hoare triple {28768#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 98: Hoare triple {28768#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 99: Hoare triple {28768#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 100: Hoare triple {28768#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,455 INFO L290 TraceCheckUtils]: 101: Hoare triple {28768#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,456 INFO L290 TraceCheckUtils]: 102: Hoare triple {28768#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,456 INFO L290 TraceCheckUtils]: 103: Hoare triple {28768#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {28768#false} is VALID [2022-04-15 11:46:22,456 INFO L290 TraceCheckUtils]: 104: Hoare triple {28768#false} assume 8640 == #t~mem75;havoc #t~mem75; {28768#false} is VALID [2022-04-15 11:46:22,456 INFO L290 TraceCheckUtils]: 105: Hoare triple {28768#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {28768#false} is VALID [2022-04-15 11:46:22,456 INFO L290 TraceCheckUtils]: 106: Hoare triple {28768#false} assume !(9 == ~blastFlag~0); {28768#false} is VALID [2022-04-15 11:46:22,456 INFO L290 TraceCheckUtils]: 107: Hoare triple {28768#false} assume !false; {28768#false} is VALID [2022-04-15 11:46:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:46:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:22,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759791965] [2022-04-15 11:46:22,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759791965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:22,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:22,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:22,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:22,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894130022] [2022-04-15 11:46:22,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894130022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:22,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:22,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:22,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236497706] [2022-04-15 11:46:22,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:22,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-15 11:46:22,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:22,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:22,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:22,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:22,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:22,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:22,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:22,515 INFO L87 Difference]: Start difference. First operand 321 states and 515 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:26,712 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-15 11:46:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:28,701 INFO L93 Difference]: Finished difference Result 696 states and 1114 transitions. [2022-04-15 11:46:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-15 11:46:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-15 11:46:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-15 11:46:28,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-15 11:46:29,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:29,124 INFO L225 Difference]: With dead ends: 696 [2022-04-15 11:46:29,124 INFO L226 Difference]: Without dead ends: 401 [2022-04-15 11:46:29,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:29,125 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 147 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:29,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 356 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:46:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-15 11:46:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 321. [2022-04-15 11:46:29,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:29,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 321 states, 316 states have (on average 1.6012658227848102) internal successors, (506), 316 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:29,136 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 321 states, 316 states have (on average 1.6012658227848102) internal successors, (506), 316 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:29,137 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 321 states, 316 states have (on average 1.6012658227848102) internal successors, (506), 316 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:29,145 INFO L93 Difference]: Finished difference Result 401 states and 624 transitions. [2022-04-15 11:46:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 624 transitions. [2022-04-15 11:46:29,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:29,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:29,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 316 states have (on average 1.6012658227848102) internal successors, (506), 316 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 401 states. [2022-04-15 11:46:29,146 INFO L87 Difference]: Start difference. First operand has 321 states, 316 states have (on average 1.6012658227848102) internal successors, (506), 316 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 401 states. [2022-04-15 11:46:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:29,154 INFO L93 Difference]: Finished difference Result 401 states and 624 transitions. [2022-04-15 11:46:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 624 transitions. [2022-04-15 11:46:29,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:29,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:29,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:29,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 316 states have (on average 1.6012658227848102) internal successors, (506), 316 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 510 transitions. [2022-04-15 11:46:29,163 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 510 transitions. Word has length 108 [2022-04-15 11:46:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:29,164 INFO L478 AbstractCegarLoop]: Abstraction has 321 states and 510 transitions. [2022-04-15 11:46:29,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:29,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 510 transitions. [2022-04-15 11:46:29,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 510 edges. 510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 510 transitions. [2022-04-15 11:46:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 11:46:29,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:29,566 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:29,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:46:29,566 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:29,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1494541802, now seen corresponding path program 1 times [2022-04-15 11:46:29,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:29,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390174458] [2022-04-15 11:46:29,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:29,628 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:29,628 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1494541802, now seen corresponding path program 2 times [2022-04-15 11:46:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428877115] [2022-04-15 11:46:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:29,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {31622#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {31615#true} is VALID [2022-04-15 11:46:29,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {31615#true} assume true; {31615#true} is VALID [2022-04-15 11:46:29,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31615#true} {31615#true} #705#return; {31615#true} is VALID [2022-04-15 11:46:29,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {31615#true} call ULTIMATE.init(); {31622#(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-15 11:46:29,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {31622#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {31615#true} assume true; {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31615#true} {31615#true} #705#return; {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {31615#true} call #t~ret161 := main(); {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {31615#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {31615#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L272 TraceCheckUtils]: 7: Hoare triple {31615#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {31615#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {31615#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {31615#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {31615#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {31615#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {31615#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {31615#true} is VALID [2022-04-15 11:46:29,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {31615#true} assume !false; {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {31615#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {31615#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {31615#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {31615#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {31615#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {31615#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {31615#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {31615#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {31615#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {31615#true} assume 8464 == #t~mem55;havoc #t~mem55; {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {31615#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {31615#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {31615#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {31615#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {31615#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {31615#true} ~skip~0 := 0; {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {31615#true} assume !false; {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {31615#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {31615#true} assume 12292 == #t~mem47;havoc #t~mem47; {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {31615#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {31615#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {31615#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {31615#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {31615#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {31615#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {31615#true} is VALID [2022-04-15 11:46:29,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {31615#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {31615#true} is VALID [2022-04-15 11:46:29,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {31615#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {31620#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31621#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {31621#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {31616#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {31616#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {31616#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {31616#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {31616#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {31616#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {31616#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {31616#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 61: Hoare triple {31616#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {31616#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {31616#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {31616#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {31616#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 66: Hoare triple {31616#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 67: Hoare triple {31616#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 68: Hoare triple {31616#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 69: Hoare triple {31616#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 70: Hoare triple {31616#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 71: Hoare triple {31616#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {31616#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {31616#false} assume 8608 == #t~mem73;havoc #t~mem73; {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {31616#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {31616#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {31616#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {31616#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {31616#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {31616#false} ~skip~0 := 0; {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 80: Hoare triple {31616#false} assume !false; {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 81: Hoare triple {31616#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 82: Hoare triple {31616#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 83: Hoare triple {31616#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 84: Hoare triple {31616#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 85: Hoare triple {31616#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 86: Hoare triple {31616#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,740 INFO L290 TraceCheckUtils]: 87: Hoare triple {31616#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 88: Hoare triple {31616#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 89: Hoare triple {31616#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 90: Hoare triple {31616#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 91: Hoare triple {31616#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 92: Hoare triple {31616#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 93: Hoare triple {31616#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 94: Hoare triple {31616#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 95: Hoare triple {31616#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 96: Hoare triple {31616#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 97: Hoare triple {31616#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 98: Hoare triple {31616#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 99: Hoare triple {31616#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 100: Hoare triple {31616#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,741 INFO L290 TraceCheckUtils]: 101: Hoare triple {31616#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 102: Hoare triple {31616#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 103: Hoare triple {31616#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 104: Hoare triple {31616#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 105: Hoare triple {31616#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 106: Hoare triple {31616#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 107: Hoare triple {31616#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 108: Hoare triple {31616#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 109: Hoare triple {31616#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 110: Hoare triple {31616#false} assume 8640 == #t~mem75;havoc #t~mem75; {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 111: Hoare triple {31616#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 112: Hoare triple {31616#false} assume !(9 == ~blastFlag~0); {31616#false} is VALID [2022-04-15 11:46:29,742 INFO L290 TraceCheckUtils]: 113: Hoare triple {31616#false} assume !false; {31616#false} is VALID [2022-04-15 11:46:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 11:46:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:29,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428877115] [2022-04-15 11:46:29,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428877115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:29,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:29,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:29,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:29,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390174458] [2022-04-15 11:46:29,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390174458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:29,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:29,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135796281] [2022-04-15 11:46:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 11:46:29,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:29,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:29,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:29,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:29,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:29,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:29,809 INFO L87 Difference]: Start difference. First operand 321 states and 510 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:35,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:39,379 INFO L93 Difference]: Finished difference Result 645 states and 1031 transitions. [2022-04-15 11:46:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 11:46:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-15 11:46:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-15 11:46:39,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 460 transitions. [2022-04-15 11:46:39,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:39,647 INFO L225 Difference]: With dead ends: 645 [2022-04-15 11:46:39,647 INFO L226 Difference]: Without dead ends: 350 [2022-04-15 11:46:39,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:39,648 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 20 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:39,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 582 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 400 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 11:46:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-04-15 11:46:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 337. [2022-04-15 11:46:39,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:39,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand has 337 states, 332 states have (on average 1.5963855421686748) internal successors, (530), 332 states have internal predecessors, (530), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:39,659 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand has 337 states, 332 states have (on average 1.5963855421686748) internal successors, (530), 332 states have internal predecessors, (530), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:39,660 INFO L87 Difference]: Start difference. First operand 350 states. Second operand has 337 states, 332 states have (on average 1.5963855421686748) internal successors, (530), 332 states have internal predecessors, (530), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:39,666 INFO L93 Difference]: Finished difference Result 350 states and 550 transitions. [2022-04-15 11:46:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 550 transitions. [2022-04-15 11:46:39,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:39,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:39,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 332 states have (on average 1.5963855421686748) internal successors, (530), 332 states have internal predecessors, (530), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 350 states. [2022-04-15 11:46:39,667 INFO L87 Difference]: Start difference. First operand has 337 states, 332 states have (on average 1.5963855421686748) internal successors, (530), 332 states have internal predecessors, (530), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 350 states. [2022-04-15 11:46:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:39,673 INFO L93 Difference]: Finished difference Result 350 states and 550 transitions. [2022-04-15 11:46:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 550 transitions. [2022-04-15 11:46:39,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:39,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:39,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:39,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 332 states have (on average 1.5963855421686748) internal successors, (530), 332 states have internal predecessors, (530), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 534 transitions. [2022-04-15 11:46:39,686 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 534 transitions. Word has length 114 [2022-04-15 11:46:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:39,687 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 534 transitions. [2022-04-15 11:46:39,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:39,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 337 states and 534 transitions. [2022-04-15 11:46:40,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 534 edges. 534 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 534 transitions. [2022-04-15 11:46:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 11:46:40,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:40,074 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:40,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:46:40,074 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:40,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash 648013207, now seen corresponding path program 1 times [2022-04-15 11:46:40,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:40,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147646575] [2022-04-15 11:46:40,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:40,154 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:40,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash 648013207, now seen corresponding path program 2 times [2022-04-15 11:46:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:40,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514565348] [2022-04-15 11:46:40,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:40,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {34299#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {34291#true} is VALID [2022-04-15 11:46:40,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {34291#true} assume true; {34291#true} is VALID [2022-04-15 11:46:40,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34291#true} {34291#true} #705#return; {34291#true} is VALID [2022-04-15 11:46:40,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {34291#true} call ULTIMATE.init(); {34299#(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-15 11:46:40,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {34299#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {34291#true} is VALID [2022-04-15 11:46:40,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {34291#true} assume true; {34291#true} is VALID [2022-04-15 11:46:40,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34291#true} {34291#true} #705#return; {34291#true} is VALID [2022-04-15 11:46:40,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {34291#true} call #t~ret161 := main(); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {34291#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {34291#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L272 TraceCheckUtils]: 7: Hoare triple {34291#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {34291#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {34291#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {34291#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {34291#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {34291#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {34291#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {34291#true} assume !false; {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {34291#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {34291#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {34291#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {34291#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {34291#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {34291#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {34291#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {34291#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {34291#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {34291#true} assume 8464 == #t~mem55;havoc #t~mem55; {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {34291#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {34291#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {34291#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {34291#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {34291#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {34291#true} ~skip~0 := 0; {34291#true} is VALID [2022-04-15 11:46:40,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {34291#true} assume !false; {34291#true} is VALID [2022-04-15 11:46:40,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {34291#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34296#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:40,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {34296#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:40,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:40,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:40,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:40,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:40,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:40,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:40,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {34297#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {34298#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-15 11:46:40,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {34298#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {34292#false} is VALID [2022-04-15 11:46:40,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {34292#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {34292#false} is VALID [2022-04-15 11:46:40,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {34292#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {34292#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34292#false} is VALID [2022-04-15 11:46:40,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {34292#false} ~skip~0 := 0; {34292#false} is VALID [2022-04-15 11:46:40,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {34292#false} assume !false; {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {34292#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {34292#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {34292#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {34292#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {34292#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {34292#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {34292#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {34292#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {34292#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {34292#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {34292#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {34292#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,353 INFO L290 TraceCheckUtils]: 59: Hoare triple {34292#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {34292#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {34292#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 62: Hoare triple {34292#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 63: Hoare triple {34292#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 64: Hoare triple {34292#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 65: Hoare triple {34292#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 66: Hoare triple {34292#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {34292#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {34292#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {34292#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {34292#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 71: Hoare triple {34292#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {34292#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {34292#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {34292#false} assume 8608 == #t~mem73;havoc #t~mem73; {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 75: Hoare triple {34292#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {34292#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {34292#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {34292#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 79: Hoare triple {34292#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 80: Hoare triple {34292#false} ~skip~0 := 0; {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 81: Hoare triple {34292#false} assume !false; {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 82: Hoare triple {34292#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 83: Hoare triple {34292#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 84: Hoare triple {34292#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {34292#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {34292#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {34292#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,355 INFO L290 TraceCheckUtils]: 88: Hoare triple {34292#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 89: Hoare triple {34292#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 90: Hoare triple {34292#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 91: Hoare triple {34292#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 92: Hoare triple {34292#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 93: Hoare triple {34292#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 94: Hoare triple {34292#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 95: Hoare triple {34292#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 96: Hoare triple {34292#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {34292#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 98: Hoare triple {34292#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 99: Hoare triple {34292#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 100: Hoare triple {34292#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 101: Hoare triple {34292#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,356 INFO L290 TraceCheckUtils]: 102: Hoare triple {34292#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 103: Hoare triple {34292#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 104: Hoare triple {34292#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 105: Hoare triple {34292#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 106: Hoare triple {34292#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 107: Hoare triple {34292#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 108: Hoare triple {34292#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 109: Hoare triple {34292#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 110: Hoare triple {34292#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 111: Hoare triple {34292#false} assume 8640 == #t~mem75;havoc #t~mem75; {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 112: Hoare triple {34292#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 113: Hoare triple {34292#false} assume !(9 == ~blastFlag~0); {34292#false} is VALID [2022-04-15 11:46:40,357 INFO L290 TraceCheckUtils]: 114: Hoare triple {34292#false} assume !false; {34292#false} is VALID [2022-04-15 11:46:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-15 11:46:40,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514565348] [2022-04-15 11:46:40,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514565348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:40,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:40,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:46:40,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147646575] [2022-04-15 11:46:40,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147646575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:40,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:40,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:46:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105602605] [2022-04-15 11:46:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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 115 [2022-04-15 11:46:40,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:40,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:46:40,430 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-15 11:46:40,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:46:40,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:40,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:46:40,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:40,431 INFO L87 Difference]: Start difference. First operand 337 states and 534 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:46:43,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:48,257 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-15 11:46:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:49,441 INFO L93 Difference]: Finished difference Result 657 states and 1050 transitions. [2022-04-15 11:46:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:46:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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 115 [2022-04-15 11:46:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:46:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 431 transitions. [2022-04-15 11:46:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:46:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 431 transitions. [2022-04-15 11:46:49,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 431 transitions. [2022-04-15 11:46:49,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:49,743 INFO L225 Difference]: With dead ends: 657 [2022-04-15 11:46:49,744 INFO L226 Difference]: Without dead ends: 346 [2022-04-15 11:46:49,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:46:49,745 INFO L913 BasicCegarLoop]: 207 mSDtfsCounter, 3 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:49,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 649 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 11:46:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-04-15 11:46:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-04-15 11:46:49,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:49,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 346 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 341 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,757 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 346 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 341 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,757 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 346 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 341 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:49,764 INFO L93 Difference]: Finished difference Result 346 states and 545 transitions. [2022-04-15 11:46:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 545 transitions. [2022-04-15 11:46:49,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:49,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:49,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 341 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 346 states. [2022-04-15 11:46:49,765 INFO L87 Difference]: Start difference. First operand has 346 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 341 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 346 states. [2022-04-15 11:46:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:49,775 INFO L93 Difference]: Finished difference Result 346 states and 545 transitions. [2022-04-15 11:46:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 545 transitions. [2022-04-15 11:46:49,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:49,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:49,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:49,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 341 states have internal predecessors, (541), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 545 transitions. [2022-04-15 11:46:49,785 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 545 transitions. Word has length 115 [2022-04-15 11:46:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:49,785 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 545 transitions. [2022-04-15 11:46:49,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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-15 11:46:49,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 346 states and 545 transitions. [2022-04-15 11:46:50,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 545 edges. 545 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 545 transitions. [2022-04-15 11:46:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 11:46:50,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:50,223 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:50,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:46:50,223 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:50,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1080592946, now seen corresponding path program 1 times [2022-04-15 11:46:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:50,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85480384] [2022-04-15 11:46:50,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:50,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:50,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1080592946, now seen corresponding path program 2 times [2022-04-15 11:46:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:50,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932697914] [2022-04-15 11:46:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:50,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {37009#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37002#true} is VALID [2022-04-15 11:46:50,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {37002#true} assume true; {37002#true} is VALID [2022-04-15 11:46:50,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37002#true} {37002#true} #705#return; {37002#true} is VALID [2022-04-15 11:46:50,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {37002#true} call ULTIMATE.init(); {37009#(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-15 11:46:50,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {37009#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37002#true} is VALID [2022-04-15 11:46:50,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {37002#true} assume true; {37002#true} is VALID [2022-04-15 11:46:50,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37002#true} {37002#true} #705#return; {37002#true} is VALID [2022-04-15 11:46:50,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {37002#true} call #t~ret161 := main(); {37002#true} is VALID [2022-04-15 11:46:50,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {37002#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {37002#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L272 TraceCheckUtils]: 7: Hoare triple {37002#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {37002#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {37002#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {37002#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {37002#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {37002#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {37002#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {37002#true} assume !false; {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {37002#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {37002#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {37002#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {37002#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {37002#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {37002#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {37002#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {37002#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {37002#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37002#true} is VALID [2022-04-15 11:46:50,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {37002#true} assume 8464 == #t~mem55;havoc #t~mem55; {37002#true} is VALID [2022-04-15 11:46:50,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {37002#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37002#true} is VALID [2022-04-15 11:46:50,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {37002#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37002#true} is VALID [2022-04-15 11:46:50,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {37002#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {37007#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37008#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {37008#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {37003#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {37003#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {37003#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {37003#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {37003#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {37003#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 42: Hoare triple {37003#false} assume 12292 != #t~mem85;havoc #t~mem85; {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 43: Hoare triple {37003#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {37003#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {37003#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {37003#false} ~skip~0 := 0; {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {37003#false} assume !false; {37003#false} is VALID [2022-04-15 11:46:50,408 INFO L290 TraceCheckUtils]: 48: Hoare triple {37003#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {37003#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {37003#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {37003#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 52: Hoare triple {37003#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {37003#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {37003#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 55: Hoare triple {37003#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {37003#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {37003#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {37003#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {37003#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {37003#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {37003#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {37003#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {37003#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 64: Hoare triple {37003#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {37003#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {37003#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {37003#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {37003#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {37003#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {37003#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 71: Hoare triple {37003#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {37003#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 73: Hoare triple {37003#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 74: Hoare triple {37003#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 75: Hoare triple {37003#false} assume 8608 == #t~mem73;havoc #t~mem73; {37003#false} is VALID [2022-04-15 11:46:50,410 INFO L290 TraceCheckUtils]: 76: Hoare triple {37003#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {37003#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {37003#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 79: Hoare triple {37003#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 80: Hoare triple {37003#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 81: Hoare triple {37003#false} ~skip~0 := 0; {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {37003#false} assume !false; {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 83: Hoare triple {37003#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 84: Hoare triple {37003#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 85: Hoare triple {37003#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 86: Hoare triple {37003#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 87: Hoare triple {37003#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 88: Hoare triple {37003#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 89: Hoare triple {37003#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,411 INFO L290 TraceCheckUtils]: 90: Hoare triple {37003#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 91: Hoare triple {37003#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 92: Hoare triple {37003#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 93: Hoare triple {37003#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 94: Hoare triple {37003#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 95: Hoare triple {37003#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 96: Hoare triple {37003#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 97: Hoare triple {37003#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 98: Hoare triple {37003#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 99: Hoare triple {37003#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 100: Hoare triple {37003#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 101: Hoare triple {37003#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 102: Hoare triple {37003#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 103: Hoare triple {37003#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,412 INFO L290 TraceCheckUtils]: 104: Hoare triple {37003#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 105: Hoare triple {37003#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 106: Hoare triple {37003#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 107: Hoare triple {37003#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 108: Hoare triple {37003#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 109: Hoare triple {37003#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 110: Hoare triple {37003#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 111: Hoare triple {37003#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 112: Hoare triple {37003#false} assume 8640 == #t~mem75;havoc #t~mem75; {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 113: Hoare triple {37003#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 114: Hoare triple {37003#false} assume !(9 == ~blastFlag~0); {37003#false} is VALID [2022-04-15 11:46:50,413 INFO L290 TraceCheckUtils]: 115: Hoare triple {37003#false} assume !false; {37003#false} is VALID [2022-04-15 11:46:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:46:50,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:50,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932697914] [2022-04-15 11:46:50,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932697914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:50,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:50,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:50,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:50,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85480384] [2022-04-15 11:46:50,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85480384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:50,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:50,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741018057] [2022-04-15 11:46:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 11:46:50,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:50,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:50,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:50,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:50,476 INFO L87 Difference]: Start difference. First operand 346 states and 545 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:57,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:59,039 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-15 11:47:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:00,287 INFO L93 Difference]: Finished difference Result 755 states and 1185 transitions. [2022-04-15 11:47:00,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:00,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 11:47:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-15 11:47:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-15 11:47:00,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 603 transitions. [2022-04-15 11:47:00,704 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-15 11:47:00,712 INFO L225 Difference]: With dead ends: 755 [2022-04-15 11:47:00,712 INFO L226 Difference]: Without dead ends: 435 [2022-04-15 11:47:00,713 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:00,713 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 150 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:00,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 356 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 477 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 11:47:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-04-15 11:47:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 346. [2022-04-15 11:47:00,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:00,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 346 states, 341 states have (on average 1.5689149560117301) internal successors, (535), 341 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:00,725 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 346 states, 341 states have (on average 1.5689149560117301) internal successors, (535), 341 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:00,726 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 346 states, 341 states have (on average 1.5689149560117301) internal successors, (535), 341 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:00,734 INFO L93 Difference]: Finished difference Result 435 states and 664 transitions. [2022-04-15 11:47:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 664 transitions. [2022-04-15 11:47:00,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:00,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:00,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 341 states have (on average 1.5689149560117301) internal successors, (535), 341 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 435 states. [2022-04-15 11:47:00,736 INFO L87 Difference]: Start difference. First operand has 346 states, 341 states have (on average 1.5689149560117301) internal successors, (535), 341 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 435 states. [2022-04-15 11:47:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:00,745 INFO L93 Difference]: Finished difference Result 435 states and 664 transitions. [2022-04-15 11:47:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 664 transitions. [2022-04-15 11:47:00,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:00,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:00,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:00,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 341 states have (on average 1.5689149560117301) internal successors, (535), 341 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 539 transitions. [2022-04-15 11:47:00,756 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 539 transitions. Word has length 116 [2022-04-15 11:47:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:00,756 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 539 transitions. [2022-04-15 11:47:00,757 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:00,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 346 states and 539 transitions. [2022-04-15 11:47:01,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 539 transitions. [2022-04-15 11:47:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 11:47:01,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:01,170 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:01,170 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:47:01,170 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1523146640, now seen corresponding path program 1 times [2022-04-15 11:47:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:01,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436436092] [2022-04-15 11:47:01,225 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:01,225 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:01,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1523146640, now seen corresponding path program 2 times [2022-04-15 11:47:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:01,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857095976] [2022-04-15 11:47:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:01,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:01,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {40093#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40086#true} is VALID [2022-04-15 11:47:01,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {40086#true} assume true; {40086#true} is VALID [2022-04-15 11:47:01,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40086#true} {40086#true} #705#return; {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {40086#true} call ULTIMATE.init(); {40093#(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-15 11:47:01,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {40093#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {40086#true} assume true; {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40086#true} {40086#true} #705#return; {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {40086#true} call #t~ret161 := main(); {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {40086#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {40086#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L272 TraceCheckUtils]: 7: Hoare triple {40086#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {40086#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {40086#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {40086#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {40086#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {40086#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {40086#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {40086#true} assume !false; {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {40086#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {40086#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {40086#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {40086#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {40086#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {40086#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {40086#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {40086#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {40086#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40086#true} is VALID [2022-04-15 11:47:01,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {40086#true} assume 8464 == #t~mem55;havoc #t~mem55; {40086#true} is VALID [2022-04-15 11:47:01,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {40086#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40086#true} is VALID [2022-04-15 11:47:01,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {40086#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40086#true} is VALID [2022-04-15 11:47:01,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {40086#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:01,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:01,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:01,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:01,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:01,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:01,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:01,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:01,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {40091#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40092#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-15 11:47:01,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {40092#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {40087#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {40087#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {40087#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {40087#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {40087#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {40087#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {40087#false} assume 12292 != #t~mem85;havoc #t~mem85; {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {40087#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {40087#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {40087#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {40087#false} ~skip~0 := 0; {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {40087#false} assume !false; {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {40087#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {40087#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {40087#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {40087#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {40087#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {40087#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 55: Hoare triple {40087#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 56: Hoare triple {40087#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 57: Hoare triple {40087#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {40087#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {40087#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {40087#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 61: Hoare triple {40087#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {40087#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {40087#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {40087#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {40087#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {40087#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {40087#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {40087#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 69: Hoare triple {40087#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 70: Hoare triple {40087#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 71: Hoare triple {40087#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 72: Hoare triple {40087#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 73: Hoare triple {40087#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 74: Hoare triple {40087#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 75: Hoare triple {40087#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 76: Hoare triple {40087#false} assume 8608 == #t~mem73;havoc #t~mem73; {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {40087#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {40087#false} is VALID [2022-04-15 11:47:01,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {40087#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 79: Hoare triple {40087#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 80: Hoare triple {40087#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 81: Hoare triple {40087#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 82: Hoare triple {40087#false} ~skip~0 := 0; {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 83: Hoare triple {40087#false} assume !false; {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 84: Hoare triple {40087#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 85: Hoare triple {40087#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {40087#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 87: Hoare triple {40087#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {40087#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 89: Hoare triple {40087#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 90: Hoare triple {40087#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 91: Hoare triple {40087#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,365 INFO L290 TraceCheckUtils]: 92: Hoare triple {40087#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 93: Hoare triple {40087#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 94: Hoare triple {40087#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 95: Hoare triple {40087#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 96: Hoare triple {40087#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 97: Hoare triple {40087#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 98: Hoare triple {40087#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 99: Hoare triple {40087#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 100: Hoare triple {40087#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 101: Hoare triple {40087#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 102: Hoare triple {40087#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 103: Hoare triple {40087#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 104: Hoare triple {40087#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 105: Hoare triple {40087#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,366 INFO L290 TraceCheckUtils]: 106: Hoare triple {40087#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 107: Hoare triple {40087#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 108: Hoare triple {40087#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 109: Hoare triple {40087#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 110: Hoare triple {40087#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 111: Hoare triple {40087#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 112: Hoare triple {40087#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 113: Hoare triple {40087#false} assume 8640 == #t~mem75;havoc #t~mem75; {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 114: Hoare triple {40087#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 115: Hoare triple {40087#false} assume !(9 == ~blastFlag~0); {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L290 TraceCheckUtils]: 116: Hoare triple {40087#false} assume !false; {40087#false} is VALID [2022-04-15 11:47:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:47:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:01,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857095976] [2022-04-15 11:47:01,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857095976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:01,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:01,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:01,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:01,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436436092] [2022-04-15 11:47:01,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436436092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:01,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:01,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:01,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428032489] [2022-04-15 11:47:01,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:01,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-15 11:47:01,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:01,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:01,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:01,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:01,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:01,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:01,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:01,422 INFO L87 Difference]: Start difference. First operand 346 states and 539 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:04,371 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-15 11:47:06,886 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-15 11:47:08,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:10,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:12,058 INFO L93 Difference]: Finished difference Result 745 states and 1160 transitions. [2022-04-15 11:47:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-15 11:47:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2022-04-15 11:47:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2022-04-15 11:47:12,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 600 transitions. [2022-04-15 11:47:12,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:12,485 INFO L225 Difference]: With dead ends: 745 [2022-04-15 11:47:12,485 INFO L226 Difference]: Without dead ends: 425 [2022-04-15 11:47:12,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:12,487 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 147 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:12,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 374 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 484 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 11:47:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-15 11:47:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 346. [2022-04-15 11:47:12,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:12,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 346 states, 341 states have (on average 1.5513196480938416) internal successors, (529), 341 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,521 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 346 states, 341 states have (on average 1.5513196480938416) internal successors, (529), 341 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,527 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 346 states, 341 states have (on average 1.5513196480938416) internal successors, (529), 341 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:12,536 INFO L93 Difference]: Finished difference Result 425 states and 645 transitions. [2022-04-15 11:47:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 645 transitions. [2022-04-15 11:47:12,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:12,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:12,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 341 states have (on average 1.5513196480938416) internal successors, (529), 341 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 425 states. [2022-04-15 11:47:12,538 INFO L87 Difference]: Start difference. First operand has 346 states, 341 states have (on average 1.5513196480938416) internal successors, (529), 341 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 425 states. [2022-04-15 11:47:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:12,559 INFO L93 Difference]: Finished difference Result 425 states and 645 transitions. [2022-04-15 11:47:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 645 transitions. [2022-04-15 11:47:12,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:12,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:12,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:12,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 341 states have (on average 1.5513196480938416) internal successors, (529), 341 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 533 transitions. [2022-04-15 11:47:12,571 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 533 transitions. Word has length 117 [2022-04-15 11:47:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:12,571 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 533 transitions. [2022-04-15 11:47:12,571 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 346 states and 533 transitions. [2022-04-15 11:47:13,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 533 edges. 533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 533 transitions. [2022-04-15 11:47:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 11:47:13,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:13,035 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:13,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:47:13,035 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash 522977736, now seen corresponding path program 1 times [2022-04-15 11:47:13,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:13,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1087902054] [2022-04-15 11:47:13,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:13,103 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:13,103 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash 522977736, now seen corresponding path program 2 times [2022-04-15 11:47:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:13,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535628057] [2022-04-15 11:47:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:13,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:13,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:13,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {43137#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {43130#true} is VALID [2022-04-15 11:47:13,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {43130#true} assume true; {43130#true} is VALID [2022-04-15 11:47:13,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43130#true} {43130#true} #705#return; {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {43130#true} call ULTIMATE.init(); {43137#(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-15 11:47:13,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {43137#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {43130#true} assume true; {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43130#true} {43130#true} #705#return; {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {43130#true} call #t~ret161 := main(); {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {43130#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {43130#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L272 TraceCheckUtils]: 7: Hoare triple {43130#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {43130#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {43130#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {43130#true} is VALID [2022-04-15 11:47:13,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {43130#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {43130#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {43130#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {43130#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {43130#true} assume !false; {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {43130#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {43130#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {43130#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {43130#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {43130#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {43130#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {43130#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {43130#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {43130#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43130#true} is VALID [2022-04-15 11:47:13,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {43130#true} assume 8464 == #t~mem55;havoc #t~mem55; {43130#true} is VALID [2022-04-15 11:47:13,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {43130#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {43130#true} is VALID [2022-04-15 11:47:13,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {43130#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {43130#true} is VALID [2022-04-15 11:47:13,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {43130#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:13,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:13,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:13,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:13,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:13,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {43135#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43136#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-15 11:47:13,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {43136#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {43131#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {43131#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {43131#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {43131#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {43131#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {43131#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {43131#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {43131#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {43131#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {43131#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {43131#false} ~skip~0 := 0; {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {43131#false} assume !false; {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {43131#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {43131#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {43131#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {43131#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {43131#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {43131#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {43131#false} assume 8480 == #t~mem52;havoc #t~mem52; {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {43131#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {43131#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {43131#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {43131#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {43131#false} ~skip~0 := 0; {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {43131#false} assume !false; {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {43131#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {43131#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {43131#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {43131#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {43131#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {43131#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {43131#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {43131#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {43131#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 68: Hoare triple {43131#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {43131#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 70: Hoare triple {43131#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {43131#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {43131#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {43131#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 74: Hoare triple {43131#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {43131#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {43131#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {43131#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {43131#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {43131#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {43131#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {43131#false} assume 8448 == #t~mem68;havoc #t~mem68; {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 82: Hoare triple {43131#false} assume !(~num1~0 > 0); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 83: Hoare triple {43131#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 84: Hoare triple {43131#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 85: Hoare triple {43131#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {43131#false} ~skip~0 := 0; {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {43131#false} assume !false; {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 88: Hoare triple {43131#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {43131#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 90: Hoare triple {43131#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 91: Hoare triple {43131#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 92: Hoare triple {43131#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 93: Hoare triple {43131#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 94: Hoare triple {43131#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 95: Hoare triple {43131#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 96: Hoare triple {43131#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {43131#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 98: Hoare triple {43131#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 99: Hoare triple {43131#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 100: Hoare triple {43131#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 101: Hoare triple {43131#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 102: Hoare triple {43131#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,213 INFO L290 TraceCheckUtils]: 103: Hoare triple {43131#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 104: Hoare triple {43131#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 105: Hoare triple {43131#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 106: Hoare triple {43131#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 107: Hoare triple {43131#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 108: Hoare triple {43131#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 109: Hoare triple {43131#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 110: Hoare triple {43131#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 111: Hoare triple {43131#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 112: Hoare triple {43131#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 113: Hoare triple {43131#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 114: Hoare triple {43131#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 115: Hoare triple {43131#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 116: Hoare triple {43131#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {43131#false} is VALID [2022-04-15 11:47:13,214 INFO L290 TraceCheckUtils]: 117: Hoare triple {43131#false} assume 8640 == #t~mem75;havoc #t~mem75; {43131#false} is VALID [2022-04-15 11:47:13,215 INFO L290 TraceCheckUtils]: 118: Hoare triple {43131#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {43131#false} is VALID [2022-04-15 11:47:13,215 INFO L290 TraceCheckUtils]: 119: Hoare triple {43131#false} assume !(9 == ~blastFlag~0); {43131#false} is VALID [2022-04-15 11:47:13,215 INFO L290 TraceCheckUtils]: 120: Hoare triple {43131#false} assume !false; {43131#false} is VALID [2022-04-15 11:47:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 11:47:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:13,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535628057] [2022-04-15 11:47:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535628057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:13,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:13,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:13,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:13,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1087902054] [2022-04-15 11:47:13,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1087902054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:13,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:13,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906468388] [2022-04-15 11:47:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:13,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 11:47:13,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:13,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:13,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:13,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:13,278 INFO L87 Difference]: Start difference. First operand 346 states and 533 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:14,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:20,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:20,963 INFO L93 Difference]: Finished difference Result 673 states and 1046 transitions. [2022-04-15 11:47:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 11:47:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-15 11:47:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-15 11:47:20,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 460 transitions. [2022-04-15 11:47:21,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:21,227 INFO L225 Difference]: With dead ends: 673 [2022-04-15 11:47:21,227 INFO L226 Difference]: Without dead ends: 353 [2022-04-15 11:47:21,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:21,229 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 30 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:21,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 537 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 11:47:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-15 11:47:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 346. [2022-04-15 11:47:21,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:21,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 346 states, 341 states have (on average 1.5483870967741935) internal successors, (528), 341 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:21,245 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 346 states, 341 states have (on average 1.5483870967741935) internal successors, (528), 341 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:21,246 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 346 states, 341 states have (on average 1.5483870967741935) internal successors, (528), 341 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:21,252 INFO L93 Difference]: Finished difference Result 353 states and 542 transitions. [2022-04-15 11:47:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 542 transitions. [2022-04-15 11:47:21,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:21,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:21,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 341 states have (on average 1.5483870967741935) internal successors, (528), 341 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-15 11:47:21,253 INFO L87 Difference]: Start difference. First operand has 346 states, 341 states have (on average 1.5483870967741935) internal successors, (528), 341 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-15 11:47:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:21,259 INFO L93 Difference]: Finished difference Result 353 states and 542 transitions. [2022-04-15 11:47:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 542 transitions. [2022-04-15 11:47:21,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:21,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:21,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:21,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 341 states have (on average 1.5483870967741935) internal successors, (528), 341 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 532 transitions. [2022-04-15 11:47:21,292 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 532 transitions. Word has length 121 [2022-04-15 11:47:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:21,292 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 532 transitions. [2022-04-15 11:47:21,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:21,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 346 states and 532 transitions. [2022-04-15 11:47:21,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 532 transitions. [2022-04-15 11:47:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 11:47:21,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:21,674 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:21,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:47:21,674 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1085303227, now seen corresponding path program 1 times [2022-04-15 11:47:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:21,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993029104] [2022-04-15 11:47:21,749 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:21,749 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:21,749 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1085303227, now seen corresponding path program 2 times [2022-04-15 11:47:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:21,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325286311] [2022-04-15 11:47:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:21,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {45893#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45886#true} is VALID [2022-04-15 11:47:21,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {45886#true} assume true; {45886#true} is VALID [2022-04-15 11:47:21,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45886#true} {45886#true} #705#return; {45886#true} is VALID [2022-04-15 11:47:21,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {45886#true} call ULTIMATE.init(); {45893#(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-15 11:47:21,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {45893#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {45886#true} assume true; {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45886#true} {45886#true} #705#return; {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {45886#true} call #t~ret161 := main(); {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {45886#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {45886#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L272 TraceCheckUtils]: 7: Hoare triple {45886#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {45886#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {45886#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {45886#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {45886#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {45886#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {45886#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {45886#true} assume !false; {45886#true} is VALID [2022-04-15 11:47:21,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {45886#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {45886#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {45886#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {45886#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {45886#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {45886#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {45886#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {45886#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {45886#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {45886#true} assume 8464 == #t~mem55;havoc #t~mem55; {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {45886#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {45886#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {45886#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {45886#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {45886#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {45886#true} ~skip~0 := 0; {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {45886#true} assume !false; {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {45886#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {45886#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {45886#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {45886#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {45886#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {45886#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {45886#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {45886#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {45886#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {45886#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {45886#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {45886#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {45886#true} assume 8496 == #t~mem58;havoc #t~mem58; {45886#true} is VALID [2022-04-15 11:47:21,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {45886#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {45886#true} is VALID [2022-04-15 11:47:21,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {45886#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {45886#true} is VALID [2022-04-15 11:47:21,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {45886#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {45886#true} is VALID [2022-04-15 11:47:21,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {45886#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,878 INFO L290 TraceCheckUtils]: 52: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,885 INFO L290 TraceCheckUtils]: 70: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,885 INFO L290 TraceCheckUtils]: 71: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,885 INFO L290 TraceCheckUtils]: 72: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,886 INFO L290 TraceCheckUtils]: 75: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,887 INFO L290 TraceCheckUtils]: 78: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,888 INFO L290 TraceCheckUtils]: 79: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:21,888 INFO L290 TraceCheckUtils]: 80: Hoare triple {45891#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45892#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-15 11:47:21,888 INFO L290 TraceCheckUtils]: 81: Hoare triple {45892#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 82: Hoare triple {45887#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 83: Hoare triple {45887#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 84: Hoare triple {45887#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 85: Hoare triple {45887#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 86: Hoare triple {45887#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 87: Hoare triple {45887#false} ~skip~0 := 0; {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 88: Hoare triple {45887#false} assume !false; {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 89: Hoare triple {45887#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 90: Hoare triple {45887#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 91: Hoare triple {45887#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 92: Hoare triple {45887#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {45887#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,889 INFO L290 TraceCheckUtils]: 94: Hoare triple {45887#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 95: Hoare triple {45887#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 96: Hoare triple {45887#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 97: Hoare triple {45887#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 98: Hoare triple {45887#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 99: Hoare triple {45887#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 100: Hoare triple {45887#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 101: Hoare triple {45887#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 102: Hoare triple {45887#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 103: Hoare triple {45887#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 104: Hoare triple {45887#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {45887#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {45887#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 107: Hoare triple {45887#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,890 INFO L290 TraceCheckUtils]: 108: Hoare triple {45887#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 109: Hoare triple {45887#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 110: Hoare triple {45887#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 111: Hoare triple {45887#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 112: Hoare triple {45887#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 113: Hoare triple {45887#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 114: Hoare triple {45887#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 115: Hoare triple {45887#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 116: Hoare triple {45887#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 117: Hoare triple {45887#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 118: Hoare triple {45887#false} assume 8640 == #t~mem75;havoc #t~mem75; {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 119: Hoare triple {45887#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 120: Hoare triple {45887#false} assume !(9 == ~blastFlag~0); {45887#false} is VALID [2022-04-15 11:47:21,891 INFO L290 TraceCheckUtils]: 121: Hoare triple {45887#false} assume !false; {45887#false} is VALID [2022-04-15 11:47:21,892 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-15 11:47:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325286311] [2022-04-15 11:47:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325286311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:21,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:21,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993029104] [2022-04-15 11:47:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993029104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:21,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447893744] [2022-04-15 11:47:21,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:21,893 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-15 11:47:21,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:21,893 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-15 11:47:21,983 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-15 11:47:21,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:21,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:21,983 INFO L87 Difference]: Start difference. First operand 346 states and 532 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-15 11:47:25,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:27,021 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-15 11:47:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:29,087 INFO L93 Difference]: Finished difference Result 785 states and 1212 transitions. [2022-04-15 11:47:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:29,087 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-15 11:47:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:29,088 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-15 11:47:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-15 11:47:29,090 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-15 11:47:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-15 11:47:29,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 599 transitions. [2022-04-15 11:47:29,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:29,481 INFO L225 Difference]: With dead ends: 785 [2022-04-15 11:47:29,481 INFO L226 Difference]: Without dead ends: 465 [2022-04-15 11:47:29,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:29,483 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 123 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:29,483 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 358 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 477 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 11:47:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-04-15 11:47:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 383. [2022-04-15 11:47:29,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:29,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 465 states. Second operand has 383 states, 378 states have (on average 1.5555555555555556) internal successors, (588), 378 states have internal predecessors, (588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,518 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand has 383 states, 378 states have (on average 1.5555555555555556) internal successors, (588), 378 states have internal predecessors, (588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,519 INFO L87 Difference]: Start difference. First operand 465 states. Second operand has 383 states, 378 states have (on average 1.5555555555555556) internal successors, (588), 378 states have internal predecessors, (588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:29,529 INFO L93 Difference]: Finished difference Result 465 states and 708 transitions. [2022-04-15 11:47:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 708 transitions. [2022-04-15 11:47:29,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:29,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:29,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 378 states have (on average 1.5555555555555556) internal successors, (588), 378 states have internal predecessors, (588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 465 states. [2022-04-15 11:47:29,530 INFO L87 Difference]: Start difference. First operand has 383 states, 378 states have (on average 1.5555555555555556) internal successors, (588), 378 states have internal predecessors, (588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 465 states. [2022-04-15 11:47:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:29,540 INFO L93 Difference]: Finished difference Result 465 states and 708 transitions. [2022-04-15 11:47:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 708 transitions. [2022-04-15 11:47:29,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:29,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:29,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:29,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 378 states have (on average 1.5555555555555556) internal successors, (588), 378 states have internal predecessors, (588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 592 transitions. [2022-04-15 11:47:29,552 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 592 transitions. Word has length 122 [2022-04-15 11:47:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:29,552 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 592 transitions. [2022-04-15 11:47:29,552 INFO L479 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-15 11:47:29,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 383 states and 592 transitions. [2022-04-15 11:47:30,038 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-15 11:47:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 592 transitions. [2022-04-15 11:47:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 11:47:30,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:30,039 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:30,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:47:30,039 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1777360167, now seen corresponding path program 1 times [2022-04-15 11:47:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:30,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013096761] [2022-04-15 11:47:30,101 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:30,101 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:30,101 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1777360167, now seen corresponding path program 2 times [2022-04-15 11:47:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:30,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139431574] [2022-04-15 11:47:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:30,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:30,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {49171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {49164#true} is VALID [2022-04-15 11:47:30,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {49164#true} assume true; {49164#true} is VALID [2022-04-15 11:47:30,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49164#true} {49164#true} #705#return; {49164#true} is VALID [2022-04-15 11:47:30,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {49164#true} call ULTIMATE.init(); {49171#(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-15 11:47:30,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {49171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {49164#true} is VALID [2022-04-15 11:47:30,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {49164#true} assume true; {49164#true} is VALID [2022-04-15 11:47:30,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49164#true} {49164#true} #705#return; {49164#true} is VALID [2022-04-15 11:47:30,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {49164#true} call #t~ret161 := main(); {49164#true} is VALID [2022-04-15 11:47:30,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {49164#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {49164#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L272 TraceCheckUtils]: 7: Hoare triple {49164#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {49164#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {49164#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {49164#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {49164#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {49164#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {49164#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {49164#true} assume !false; {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {49164#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {49164#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {49164#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {49164#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {49164#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {49164#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {49164#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {49164#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {49164#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {49164#true} assume 8464 == #t~mem55;havoc #t~mem55; {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {49164#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {49164#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {49164#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {49164#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {49164#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {49164#true} ~skip~0 := 0; {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {49164#true} assume !false; {49164#true} is VALID [2022-04-15 11:47:30,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {49164#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {49164#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {49164#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {49164#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {49164#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {49164#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {49164#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {49164#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {49164#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {49164#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {49164#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {49164#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {49164#true} assume 8496 == #t~mem58;havoc #t~mem58; {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {49164#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {49164#true} is VALID [2022-04-15 11:47:30,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {49164#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {49164#true} is VALID [2022-04-15 11:47:30,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {49164#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {49164#true} is VALID [2022-04-15 11:47:30,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {49164#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,212 INFO L290 TraceCheckUtils]: 54: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,214 INFO L290 TraceCheckUtils]: 60: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,216 INFO L290 TraceCheckUtils]: 64: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,217 INFO L290 TraceCheckUtils]: 67: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,218 INFO L290 TraceCheckUtils]: 70: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,218 INFO L290 TraceCheckUtils]: 71: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,219 INFO L290 TraceCheckUtils]: 73: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,219 INFO L290 TraceCheckUtils]: 74: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,219 INFO L290 TraceCheckUtils]: 75: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,220 INFO L290 TraceCheckUtils]: 76: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,220 INFO L290 TraceCheckUtils]: 77: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,220 INFO L290 TraceCheckUtils]: 78: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,221 INFO L290 TraceCheckUtils]: 79: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,221 INFO L290 TraceCheckUtils]: 80: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:30,221 INFO L290 TraceCheckUtils]: 81: Hoare triple {49169#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {49170#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 82: Hoare triple {49170#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 83: Hoare triple {49165#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 84: Hoare triple {49165#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 85: Hoare triple {49165#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 86: Hoare triple {49165#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 87: Hoare triple {49165#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 88: Hoare triple {49165#false} ~skip~0 := 0; {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 89: Hoare triple {49165#false} assume !false; {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 90: Hoare triple {49165#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 91: Hoare triple {49165#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,222 INFO L290 TraceCheckUtils]: 92: Hoare triple {49165#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 93: Hoare triple {49165#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 94: Hoare triple {49165#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 95: Hoare triple {49165#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 96: Hoare triple {49165#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 97: Hoare triple {49165#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 98: Hoare triple {49165#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 99: Hoare triple {49165#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 100: Hoare triple {49165#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 101: Hoare triple {49165#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 102: Hoare triple {49165#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 103: Hoare triple {49165#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 104: Hoare triple {49165#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 105: Hoare triple {49165#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,223 INFO L290 TraceCheckUtils]: 106: Hoare triple {49165#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 107: Hoare triple {49165#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 108: Hoare triple {49165#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 109: Hoare triple {49165#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 110: Hoare triple {49165#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 111: Hoare triple {49165#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 112: Hoare triple {49165#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 113: Hoare triple {49165#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 114: Hoare triple {49165#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 115: Hoare triple {49165#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 116: Hoare triple {49165#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 117: Hoare triple {49165#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 118: Hoare triple {49165#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 119: Hoare triple {49165#false} assume 8640 == #t~mem75;havoc #t~mem75; {49165#false} is VALID [2022-04-15 11:47:30,224 INFO L290 TraceCheckUtils]: 120: Hoare triple {49165#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {49165#false} is VALID [2022-04-15 11:47:30,225 INFO L290 TraceCheckUtils]: 121: Hoare triple {49165#false} assume !(9 == ~blastFlag~0); {49165#false} is VALID [2022-04-15 11:47:30,225 INFO L290 TraceCheckUtils]: 122: Hoare triple {49165#false} assume !false; {49165#false} is VALID [2022-04-15 11:47:30,225 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-15 11:47:30,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139431574] [2022-04-15 11:47:30,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139431574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:30,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:30,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:30,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:30,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013096761] [2022-04-15 11:47:30,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013096761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:30,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:30,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:30,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481369132] [2022-04-15 11:47:30,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:30,226 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-15 11:47:30,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:30,227 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-15 11:47:30,301 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-15 11:47:30,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:30,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:30,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:30,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:30,302 INFO L87 Difference]: Start difference. First operand 383 states and 592 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-15 11:47:35,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:37,160 INFO L93 Difference]: Finished difference Result 835 states and 1295 transitions. [2022-04-15 11:47:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:37,160 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-15 11:47:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:37,160 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-15 11:47:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-04-15 11:47:37,162 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-15 11:47:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-04-15 11:47:37,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 560 transitions. [2022-04-15 11:47:37,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:37,542 INFO L225 Difference]: With dead ends: 835 [2022-04-15 11:47:37,542 INFO L226 Difference]: Without dead ends: 478 [2022-04-15 11:47:37,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:37,543 INFO L913 BasicCegarLoop]: 183 mSDtfsCounter, 80 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:37,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 485 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 510 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 11:47:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-04-15 11:47:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 423. [2022-04-15 11:47:37,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:37,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 478 states. Second operand has 423 states, 418 states have (on average 1.5598086124401913) internal successors, (652), 418 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:37,560 INFO L74 IsIncluded]: Start isIncluded. First operand 478 states. Second operand has 423 states, 418 states have (on average 1.5598086124401913) internal successors, (652), 418 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:37,561 INFO L87 Difference]: Start difference. First operand 478 states. Second operand has 423 states, 418 states have (on average 1.5598086124401913) internal successors, (652), 418 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:37,571 INFO L93 Difference]: Finished difference Result 478 states and 732 transitions. [2022-04-15 11:47:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 732 transitions. [2022-04-15 11:47:37,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:37,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:37,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 423 states, 418 states have (on average 1.5598086124401913) internal successors, (652), 418 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 478 states. [2022-04-15 11:47:37,572 INFO L87 Difference]: Start difference. First operand has 423 states, 418 states have (on average 1.5598086124401913) internal successors, (652), 418 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 478 states. [2022-04-15 11:47:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:37,583 INFO L93 Difference]: Finished difference Result 478 states and 732 transitions. [2022-04-15 11:47:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 732 transitions. [2022-04-15 11:47:37,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:37,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:37,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:37,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 418 states have (on average 1.5598086124401913) internal successors, (652), 418 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 656 transitions. [2022-04-15 11:47:37,598 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 656 transitions. Word has length 123 [2022-04-15 11:47:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:37,598 INFO L478 AbstractCegarLoop]: Abstraction has 423 states and 656 transitions. [2022-04-15 11:47:37,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:37,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 423 states and 656 transitions. [2022-04-15 11:47:38,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 656 edges. 656 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 656 transitions. [2022-04-15 11:47:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 11:47:38,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:38,346 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:38,346 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:47:38,346 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash -783502679, now seen corresponding path program 1 times [2022-04-15 11:47:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:38,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161913102] [2022-04-15 11:47:38,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:38,415 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:38,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -783502679, now seen corresponding path program 2 times [2022-04-15 11:47:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:38,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734830246] [2022-04-15 11:47:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:38,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {52655#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52648#true} is VALID [2022-04-15 11:47:38,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {52648#true} assume true; {52648#true} is VALID [2022-04-15 11:47:38,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52648#true} {52648#true} #705#return; {52648#true} is VALID [2022-04-15 11:47:38,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {52648#true} call ULTIMATE.init(); {52655#(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-15 11:47:38,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {52655#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52648#true} is VALID [2022-04-15 11:47:38,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {52648#true} assume true; {52648#true} is VALID [2022-04-15 11:47:38,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52648#true} {52648#true} #705#return; {52648#true} is VALID [2022-04-15 11:47:38,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {52648#true} call #t~ret161 := main(); {52648#true} is VALID [2022-04-15 11:47:38,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {52648#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {52648#true} is VALID [2022-04-15 11:47:38,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {52648#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,569 INFO L272 TraceCheckUtils]: 7: Hoare triple {52648#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {52648#true} is VALID [2022-04-15 11:47:38,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {52648#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {52648#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {52648#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {52648#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {52648#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {52648#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {52648#true} assume !false; {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {52648#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {52648#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {52648#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {52648#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {52648#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {52648#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {52648#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {52648#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {52648#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {52648#true} assume 8464 == #t~mem55;havoc #t~mem55; {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {52648#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {52648#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {52648#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {52648#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {52648#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {52648#true} ~skip~0 := 0; {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {52648#true} assume !false; {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {52648#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {52648#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {52648#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {52648#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {52648#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {52648#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {52648#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {52648#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {52648#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {52648#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {52648#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {52648#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {52648#true} assume 8496 == #t~mem58;havoc #t~mem58; {52648#true} is VALID [2022-04-15 11:47:38,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {52648#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {52648#true} is VALID [2022-04-15 11:47:38,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {52648#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52648#true} is VALID [2022-04-15 11:47:38,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {52648#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {52648#true} is VALID [2022-04-15 11:47:38,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {52648#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,579 INFO L290 TraceCheckUtils]: 58: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,579 INFO L290 TraceCheckUtils]: 59: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,580 INFO L290 TraceCheckUtils]: 62: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,581 INFO L290 TraceCheckUtils]: 63: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,581 INFO L290 TraceCheckUtils]: 64: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,582 INFO L290 TraceCheckUtils]: 65: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:47:38,582 INFO L290 TraceCheckUtils]: 67: Hoare triple {52653#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52654#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-15 11:47:38,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {52654#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,583 INFO L290 TraceCheckUtils]: 69: Hoare triple {52649#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,583 INFO L290 TraceCheckUtils]: 70: Hoare triple {52649#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {52649#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {52649#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {52649#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {52649#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {52649#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 76: Hoare triple {52649#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {52649#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 78: Hoare triple {52649#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 79: Hoare triple {52649#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {52649#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {52649#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {52649#false} assume 8609 == #t~mem74;havoc #t~mem74; {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {52649#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {52649#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 85: Hoare triple {52649#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {52649#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,584 INFO L290 TraceCheckUtils]: 87: Hoare triple {52649#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 88: Hoare triple {52649#false} ~skip~0 := 0; {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 89: Hoare triple {52649#false} assume !false; {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {52649#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 91: Hoare triple {52649#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 92: Hoare triple {52649#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 93: Hoare triple {52649#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 94: Hoare triple {52649#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 95: Hoare triple {52649#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 96: Hoare triple {52649#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 97: Hoare triple {52649#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 98: Hoare triple {52649#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 99: Hoare triple {52649#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,585 INFO L290 TraceCheckUtils]: 100: Hoare triple {52649#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 101: Hoare triple {52649#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 102: Hoare triple {52649#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 103: Hoare triple {52649#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 104: Hoare triple {52649#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 105: Hoare triple {52649#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 106: Hoare triple {52649#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 107: Hoare triple {52649#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 108: Hoare triple {52649#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 109: Hoare triple {52649#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 110: Hoare triple {52649#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 111: Hoare triple {52649#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 112: Hoare triple {52649#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,586 INFO L290 TraceCheckUtils]: 113: Hoare triple {52649#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 114: Hoare triple {52649#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 115: Hoare triple {52649#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 116: Hoare triple {52649#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 117: Hoare triple {52649#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 118: Hoare triple {52649#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 119: Hoare triple {52649#false} assume 8640 == #t~mem75;havoc #t~mem75; {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 120: Hoare triple {52649#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 121: Hoare triple {52649#false} assume !(9 == ~blastFlag~0); {52649#false} is VALID [2022-04-15 11:47:38,587 INFO L290 TraceCheckUtils]: 122: Hoare triple {52649#false} assume !false; {52649#false} is VALID [2022-04-15 11:47:38,587 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-15 11:47:38,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:38,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734830246] [2022-04-15 11:47:38,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734830246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:38,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:38,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:38,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:38,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161913102] [2022-04-15 11:47:38,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161913102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:38,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:38,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053948133] [2022-04-15 11:47:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:38,589 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-15 11:47:38,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:38,589 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-15 11:47:38,667 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-15 11:47:38,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:38,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:38,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:38,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:38,668 INFO L87 Difference]: Start difference. First operand 423 states and 656 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-15 11:47:43,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:48,077 INFO L93 Difference]: Finished difference Result 868 states and 1350 transitions. [2022-04-15 11:47:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:48,077 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-15 11:47:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:48,077 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-15 11:47:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-15 11:47:48,079 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-15 11:47:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-15 11:47:48,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 488 transitions. [2022-04-15 11:47:48,387 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-15 11:47:48,396 INFO L225 Difference]: With dead ends: 868 [2022-04-15 11:47:48,396 INFO L226 Difference]: Without dead ends: 471 [2022-04-15 11:47:48,396 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:48,397 INFO L913 BasicCegarLoop]: 248 mSDtfsCounter, 35 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:48,397 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 613 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 11:47:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-04-15 11:47:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 447. [2022-04-15 11:47:48,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:48,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 471 states. Second operand has 447 states, 442 states have (on average 1.5565610859728507) internal successors, (688), 442 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-15 11:47:48,414 INFO L74 IsIncluded]: Start isIncluded. First operand 471 states. Second operand has 447 states, 442 states have (on average 1.5565610859728507) internal successors, (688), 442 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-15 11:47:48,415 INFO L87 Difference]: Start difference. First operand 471 states. Second operand has 447 states, 442 states have (on average 1.5565610859728507) internal successors, (688), 442 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-15 11:47:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:48,425 INFO L93 Difference]: Finished difference Result 471 states and 723 transitions. [2022-04-15 11:47:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 723 transitions. [2022-04-15 11:47:48,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:48,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:48,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.5565610859728507) internal successors, (688), 442 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 471 states. [2022-04-15 11:47:48,426 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.5565610859728507) internal successors, (688), 442 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 471 states. [2022-04-15 11:47:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:48,436 INFO L93 Difference]: Finished difference Result 471 states and 723 transitions. [2022-04-15 11:47:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 723 transitions. [2022-04-15 11:47:48,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:48,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:48,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:48,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.5565610859728507) internal successors, (688), 442 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-15 11:47:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 692 transitions. [2022-04-15 11:47:48,451 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 692 transitions. Word has length 123 [2022-04-15 11:47:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:48,451 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 692 transitions. [2022-04-15 11:47:48,451 INFO L479 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-15 11:47:48,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 692 transitions. [2022-04-15 11:47:49,005 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-15 11:47:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 692 transitions. [2022-04-15 11:47:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 11:47:49,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:49,006 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:49,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:47:49,006 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1589755523, now seen corresponding path program 1 times [2022-04-15 11:47:49,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:49,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900203331] [2022-04-15 11:47:49,101 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:49,101 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:49,101 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1589755523, now seen corresponding path program 2 times [2022-04-15 11:47:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:49,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694396069] [2022-04-15 11:47:49,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:49,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {56239#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56232#true} is VALID [2022-04-15 11:47:49,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {56232#true} assume true; {56232#true} is VALID [2022-04-15 11:47:49,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56232#true} {56232#true} #705#return; {56232#true} is VALID [2022-04-15 11:47:49,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {56232#true} call ULTIMATE.init(); {56239#(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-15 11:47:49,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {56239#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56232#true} is VALID [2022-04-15 11:47:49,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {56232#true} assume true; {56232#true} is VALID [2022-04-15 11:47:49,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56232#true} {56232#true} #705#return; {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {56232#true} call #t~ret161 := main(); {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {56232#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {56232#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L272 TraceCheckUtils]: 7: Hoare triple {56232#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {56232#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {56232#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {56232#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {56232#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {56232#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {56232#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {56232#true} assume !false; {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {56232#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {56232#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {56232#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {56232#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {56232#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {56232#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {56232#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {56232#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {56232#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {56232#true} assume 8464 == #t~mem55;havoc #t~mem55; {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {56232#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {56232#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {56232#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {56232#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {56232#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56232#true} is VALID [2022-04-15 11:47:49,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {56232#true} ~skip~0 := 0; {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {56232#true} assume !false; {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {56232#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {56232#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {56232#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {56232#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {56232#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {56232#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {56232#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {56232#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {56232#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {56232#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {56232#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {56232#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {56232#true} assume 8496 == #t~mem58;havoc #t~mem58; {56232#true} is VALID [2022-04-15 11:47:49,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {56232#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {56232#true} is VALID [2022-04-15 11:47:49,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {56232#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {56232#true} is VALID [2022-04-15 11:47:49,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {56232#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {56232#true} is VALID [2022-04-15 11:47:49,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {56232#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 59: Hoare triple {56237#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56238#(= |ssl3_accept_#t~mem52| 8656)} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {56238#(= |ssl3_accept_#t~mem52| 8656)} assume 8480 == #t~mem52;havoc #t~mem52; {56233#false} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {56233#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {56233#false} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {56233#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 63: Hoare triple {56233#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 64: Hoare triple {56233#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56233#false} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 65: Hoare triple {56233#false} ~skip~0 := 0; {56233#false} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 66: Hoare triple {56233#false} assume !false; {56233#false} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 67: Hoare triple {56233#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {56233#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 69: Hoare triple {56233#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 70: Hoare triple {56233#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 71: Hoare triple {56233#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {56233#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {56233#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {56233#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {56233#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 76: Hoare triple {56233#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 77: Hoare triple {56233#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 78: Hoare triple {56233#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 79: Hoare triple {56233#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 80: Hoare triple {56233#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 81: Hoare triple {56233#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,223 INFO L290 TraceCheckUtils]: 82: Hoare triple {56233#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 83: Hoare triple {56233#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 84: Hoare triple {56233#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 85: Hoare triple {56233#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 86: Hoare triple {56233#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 87: Hoare triple {56233#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 88: Hoare triple {56233#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 89: Hoare triple {56233#false} assume 8448 == #t~mem68;havoc #t~mem68; {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 90: Hoare triple {56233#false} assume !(~num1~0 > 0); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 91: Hoare triple {56233#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 92: Hoare triple {56233#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 93: Hoare triple {56233#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 94: Hoare triple {56233#false} ~skip~0 := 0; {56233#false} is VALID [2022-04-15 11:47:49,224 INFO L290 TraceCheckUtils]: 95: Hoare triple {56233#false} assume !false; {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 96: Hoare triple {56233#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 97: Hoare triple {56233#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 98: Hoare triple {56233#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 99: Hoare triple {56233#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 100: Hoare triple {56233#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 101: Hoare triple {56233#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 102: Hoare triple {56233#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 103: Hoare triple {56233#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 104: Hoare triple {56233#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 105: Hoare triple {56233#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 106: Hoare triple {56233#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 107: Hoare triple {56233#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 108: Hoare triple {56233#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,225 INFO L290 TraceCheckUtils]: 109: Hoare triple {56233#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 110: Hoare triple {56233#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 111: Hoare triple {56233#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 112: Hoare triple {56233#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 113: Hoare triple {56233#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 114: Hoare triple {56233#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 115: Hoare triple {56233#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 116: Hoare triple {56233#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 117: Hoare triple {56233#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 118: Hoare triple {56233#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 119: Hoare triple {56233#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 120: Hoare triple {56233#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 121: Hoare triple {56233#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 122: Hoare triple {56233#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,226 INFO L290 TraceCheckUtils]: 123: Hoare triple {56233#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,227 INFO L290 TraceCheckUtils]: 124: Hoare triple {56233#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {56233#false} is VALID [2022-04-15 11:47:49,227 INFO L290 TraceCheckUtils]: 125: Hoare triple {56233#false} assume 8640 == #t~mem75;havoc #t~mem75; {56233#false} is VALID [2022-04-15 11:47:49,227 INFO L290 TraceCheckUtils]: 126: Hoare triple {56233#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {56233#false} is VALID [2022-04-15 11:47:49,227 INFO L290 TraceCheckUtils]: 127: Hoare triple {56233#false} assume !(9 == ~blastFlag~0); {56233#false} is VALID [2022-04-15 11:47:49,227 INFO L290 TraceCheckUtils]: 128: Hoare triple {56233#false} assume !false; {56233#false} is VALID [2022-04-15 11:47:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:47:49,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:49,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694396069] [2022-04-15 11:47:49,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694396069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:49,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:49,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:49,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:49,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900203331] [2022-04-15 11:47:49,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900203331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:49,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:49,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:49,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151410272] [2022-04-15 11:47:49,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:49,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 11:47:49,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:49,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:49,302 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-15 11:47:49,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:49,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:49,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:49,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:49,303 INFO L87 Difference]: Start difference. First operand 447 states and 692 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:56,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:58,920 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-15 11:48:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:00,083 INFO L93 Difference]: Finished difference Result 921 states and 1428 transitions. [2022-04-15 11:48:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:00,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 11:48:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2022-04-15 11:48:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2022-04-15 11:48:00,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 557 transitions. [2022-04-15 11:48:00,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 557 edges. 557 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:00,482 INFO L225 Difference]: With dead ends: 921 [2022-04-15 11:48:00,482 INFO L226 Difference]: Without dead ends: 500 [2022-04-15 11:48:00,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:00,483 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 101 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:00,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 487 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 11:48:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-04-15 11:48:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 447. [2022-04-15 11:48:00,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:00,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 500 states. Second operand has 447 states, 442 states have (on average 1.5542986425339367) internal successors, (687), 442 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:00,503 INFO L74 IsIncluded]: Start isIncluded. First operand 500 states. Second operand has 447 states, 442 states have (on average 1.5542986425339367) internal successors, (687), 442 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:00,503 INFO L87 Difference]: Start difference. First operand 500 states. Second operand has 447 states, 442 states have (on average 1.5542986425339367) internal successors, (687), 442 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:00,514 INFO L93 Difference]: Finished difference Result 500 states and 765 transitions. [2022-04-15 11:48:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 765 transitions. [2022-04-15 11:48:00,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:00,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:00,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.5542986425339367) internal successors, (687), 442 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 500 states. [2022-04-15 11:48:00,515 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.5542986425339367) internal successors, (687), 442 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 500 states. [2022-04-15 11:48:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:00,526 INFO L93 Difference]: Finished difference Result 500 states and 765 transitions. [2022-04-15 11:48:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 765 transitions. [2022-04-15 11:48:00,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:00,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:00,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:00,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.5542986425339367) internal successors, (687), 442 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 691 transitions. [2022-04-15 11:48:00,542 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 691 transitions. Word has length 129 [2022-04-15 11:48:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:00,542 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 691 transitions. [2022-04-15 11:48:00,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:00,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 691 transitions. [2022-04-15 11:48:01,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 691 edges. 691 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 691 transitions. [2022-04-15 11:48:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 11:48:01,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:01,025 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:01,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:48:01,026 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash 531917445, now seen corresponding path program 1 times [2022-04-15 11:48:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:01,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092873297] [2022-04-15 11:48:01,099 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:01,099 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:01,099 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 531917445, now seen corresponding path program 2 times [2022-04-15 11:48:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526114556] [2022-04-15 11:48:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:01,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {59987#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {59980#true} is VALID [2022-04-15 11:48:01,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {59980#true} assume true; {59980#true} is VALID [2022-04-15 11:48:01,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59980#true} {59980#true} #705#return; {59980#true} is VALID [2022-04-15 11:48:01,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {59980#true} call ULTIMATE.init(); {59987#(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-15 11:48:01,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {59987#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {59980#true} is VALID [2022-04-15 11:48:01,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {59980#true} assume true; {59980#true} is VALID [2022-04-15 11:48:01,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59980#true} {59980#true} #705#return; {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {59980#true} call #t~ret161 := main(); {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {59980#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {59980#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L272 TraceCheckUtils]: 7: Hoare triple {59980#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {59980#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {59980#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {59980#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {59980#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {59980#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {59980#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {59980#true} assume !false; {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {59980#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {59980#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {59980#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {59980#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {59980#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {59980#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {59980#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {59980#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {59980#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {59980#true} assume 8464 == #t~mem55;havoc #t~mem55; {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {59980#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {59980#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {59980#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {59980#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {59980#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {59980#true} ~skip~0 := 0; {59980#true} is VALID [2022-04-15 11:48:01,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {59980#true} assume !false; {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {59980#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {59980#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {59980#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {59980#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {59980#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {59980#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {59980#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {59980#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {59980#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {59980#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {59980#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {59980#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {59980#true} assume 8496 == #t~mem58;havoc #t~mem58; {59980#true} is VALID [2022-04-15 11:48:01,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {59980#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {59980#true} is VALID [2022-04-15 11:48:01,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {59980#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {59980#true} is VALID [2022-04-15 11:48:01,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {59980#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {59980#true} is VALID [2022-04-15 11:48:01,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {59980#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,237 INFO L290 TraceCheckUtils]: 54: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,237 INFO L290 TraceCheckUtils]: 56: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:01,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {59985#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59986#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {59986#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {59981#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {59981#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 63: Hoare triple {59981#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 64: Hoare triple {59981#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 65: Hoare triple {59981#false} ~skip~0 := 0; {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 66: Hoare triple {59981#false} assume !false; {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 67: Hoare triple {59981#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {59981#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {59981#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {59981#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {59981#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {59981#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {59981#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {59981#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {59981#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 76: Hoare triple {59981#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 77: Hoare triple {59981#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 78: Hoare triple {59981#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 79: Hoare triple {59981#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 80: Hoare triple {59981#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 81: Hoare triple {59981#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 82: Hoare triple {59981#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 83: Hoare triple {59981#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {59981#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 85: Hoare triple {59981#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 86: Hoare triple {59981#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 87: Hoare triple {59981#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {59981#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {59981#false} assume 8448 == #t~mem68;havoc #t~mem68; {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {59981#false} assume !(~num1~0 > 0); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 91: Hoare triple {59981#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 92: Hoare triple {59981#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 93: Hoare triple {59981#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 94: Hoare triple {59981#false} ~skip~0 := 0; {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 95: Hoare triple {59981#false} assume !false; {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 96: Hoare triple {59981#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 97: Hoare triple {59981#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,241 INFO L290 TraceCheckUtils]: 98: Hoare triple {59981#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 99: Hoare triple {59981#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 100: Hoare triple {59981#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 101: Hoare triple {59981#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 102: Hoare triple {59981#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 103: Hoare triple {59981#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 104: Hoare triple {59981#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 105: Hoare triple {59981#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 106: Hoare triple {59981#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 107: Hoare triple {59981#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 108: Hoare triple {59981#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 109: Hoare triple {59981#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 110: Hoare triple {59981#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 111: Hoare triple {59981#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,242 INFO L290 TraceCheckUtils]: 112: Hoare triple {59981#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 113: Hoare triple {59981#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 114: Hoare triple {59981#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 115: Hoare triple {59981#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 116: Hoare triple {59981#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 117: Hoare triple {59981#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 118: Hoare triple {59981#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 119: Hoare triple {59981#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 120: Hoare triple {59981#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 121: Hoare triple {59981#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 122: Hoare triple {59981#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 123: Hoare triple {59981#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 124: Hoare triple {59981#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 125: Hoare triple {59981#false} assume 8640 == #t~mem75;havoc #t~mem75; {59981#false} is VALID [2022-04-15 11:48:01,243 INFO L290 TraceCheckUtils]: 126: Hoare triple {59981#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {59981#false} is VALID [2022-04-15 11:48:01,244 INFO L290 TraceCheckUtils]: 127: Hoare triple {59981#false} assume !(9 == ~blastFlag~0); {59981#false} is VALID [2022-04-15 11:48:01,244 INFO L290 TraceCheckUtils]: 128: Hoare triple {59981#false} assume !false; {59981#false} is VALID [2022-04-15 11:48:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:48:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:01,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526114556] [2022-04-15 11:48:01,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526114556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:01,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:01,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:01,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092873297] [2022-04-15 11:48:01,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092873297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:01,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:01,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675230876] [2022-04-15 11:48:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:01,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 11:48:01,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:01,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:01,310 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-15 11:48:01,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:01,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:01,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:01,310 INFO L87 Difference]: Start difference. First operand 447 states and 691 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:05,427 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-15 11:48:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:07,310 INFO L93 Difference]: Finished difference Result 945 states and 1462 transitions. [2022-04-15 11:48:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:07,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 11:48:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-15 11:48:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-15 11:48:07,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-15 11:48:07,704 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-15 11:48:07,715 INFO L225 Difference]: With dead ends: 945 [2022-04-15 11:48:07,715 INFO L226 Difference]: Without dead ends: 524 [2022-04-15 11:48:07,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:07,716 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 144 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:07,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 362 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:48:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-04-15 11:48:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 447. [2022-04-15 11:48:07,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:07,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 524 states. Second operand has 447 states, 442 states have (on average 1.5407239819004526) internal successors, (681), 442 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:07,745 INFO L74 IsIncluded]: Start isIncluded. First operand 524 states. Second operand has 447 states, 442 states have (on average 1.5407239819004526) internal successors, (681), 442 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:07,745 INFO L87 Difference]: Start difference. First operand 524 states. Second operand has 447 states, 442 states have (on average 1.5407239819004526) internal successors, (681), 442 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:07,757 INFO L93 Difference]: Finished difference Result 524 states and 795 transitions. [2022-04-15 11:48:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 795 transitions. [2022-04-15 11:48:07,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:07,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:07,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.5407239819004526) internal successors, (681), 442 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 524 states. [2022-04-15 11:48:07,759 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.5407239819004526) internal successors, (681), 442 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 524 states. [2022-04-15 11:48:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:07,771 INFO L93 Difference]: Finished difference Result 524 states and 795 transitions. [2022-04-15 11:48:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 795 transitions. [2022-04-15 11:48:07,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:07,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:07,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:07,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.5407239819004526) internal successors, (681), 442 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 685 transitions. [2022-04-15 11:48:07,786 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 685 transitions. Word has length 129 [2022-04-15 11:48:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:07,786 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 685 transitions. [2022-04-15 11:48:07,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:07,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 685 transitions. [2022-04-15 11:48:08,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 685 transitions. [2022-04-15 11:48:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 11:48:08,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:08,334 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:08,334 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:48:08,334 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash -371331922, now seen corresponding path program 1 times [2022-04-15 11:48:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:08,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251645088] [2022-04-15 11:48:08,407 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:08,407 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:08,407 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash -371331922, now seen corresponding path program 2 times [2022-04-15 11:48:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:08,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740416718] [2022-04-15 11:48:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:08,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {63831#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {63824#true} is VALID [2022-04-15 11:48:08,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {63824#true} assume true; {63824#true} is VALID [2022-04-15 11:48:08,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63824#true} {63824#true} #705#return; {63824#true} is VALID [2022-04-15 11:48:08,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {63824#true} call ULTIMATE.init(); {63831#(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-15 11:48:08,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {63831#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {63824#true} is VALID [2022-04-15 11:48:08,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {63824#true} assume true; {63824#true} is VALID [2022-04-15 11:48:08,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63824#true} {63824#true} #705#return; {63824#true} is VALID [2022-04-15 11:48:08,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {63824#true} call #t~ret161 := main(); {63824#true} is VALID [2022-04-15 11:48:08,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {63824#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {63824#true} is VALID [2022-04-15 11:48:08,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {63824#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L272 TraceCheckUtils]: 7: Hoare triple {63824#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {63824#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {63824#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {63824#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {63824#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {63824#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {63824#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {63824#true} assume !false; {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {63824#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {63824#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {63824#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {63824#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {63824#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {63824#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {63824#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {63824#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {63824#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {63824#true} assume 8464 == #t~mem55;havoc #t~mem55; {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {63824#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {63824#true} is VALID [2022-04-15 11:48:08,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {63824#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {63824#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {63824#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {63824#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {63824#true} ~skip~0 := 0; {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {63824#true} assume !false; {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {63824#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {63824#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {63824#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {63824#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {63824#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {63824#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {63824#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {63824#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {63824#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {63824#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {63824#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {63824#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {63824#true} assume 8496 == #t~mem58;havoc #t~mem58; {63824#true} is VALID [2022-04-15 11:48:08,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {63824#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {63824#true} is VALID [2022-04-15 11:48:08,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {63824#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {63824#true} is VALID [2022-04-15 11:48:08,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {63824#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {63824#true} is VALID [2022-04-15 11:48:08,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {63824#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,536 INFO L290 TraceCheckUtils]: 58: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,537 INFO L290 TraceCheckUtils]: 61: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,537 INFO L290 TraceCheckUtils]: 62: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,538 INFO L290 TraceCheckUtils]: 64: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,539 INFO L290 TraceCheckUtils]: 67: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,540 INFO L290 TraceCheckUtils]: 69: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,540 INFO L290 TraceCheckUtils]: 71: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,541 INFO L290 TraceCheckUtils]: 72: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,541 INFO L290 TraceCheckUtils]: 73: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,541 INFO L290 TraceCheckUtils]: 74: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,542 INFO L290 TraceCheckUtils]: 75: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,542 INFO L290 TraceCheckUtils]: 76: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,542 INFO L290 TraceCheckUtils]: 77: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,543 INFO L290 TraceCheckUtils]: 78: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,543 INFO L290 TraceCheckUtils]: 79: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,544 INFO L290 TraceCheckUtils]: 80: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,544 INFO L290 TraceCheckUtils]: 81: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,544 INFO L290 TraceCheckUtils]: 83: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:08,545 INFO L290 TraceCheckUtils]: 84: Hoare triple {63829#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {63830#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-15 11:48:08,545 INFO L290 TraceCheckUtils]: 85: Hoare triple {63830#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,545 INFO L290 TraceCheckUtils]: 86: Hoare triple {63825#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,545 INFO L290 TraceCheckUtils]: 87: Hoare triple {63825#false} assume 8672 == #t~mem79;havoc #t~mem79; {63825#false} is VALID [2022-04-15 11:48:08,545 INFO L290 TraceCheckUtils]: 88: Hoare triple {63825#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {63825#false} is VALID [2022-04-15 11:48:08,545 INFO L290 TraceCheckUtils]: 89: Hoare triple {63825#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {63825#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 91: Hoare triple {63825#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 92: Hoare triple {63825#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 93: Hoare triple {63825#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 94: Hoare triple {63825#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 95: Hoare triple {63825#false} ~skip~0 := 0; {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {63825#false} assume !false; {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 97: Hoare triple {63825#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {63825#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 99: Hoare triple {63825#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 100: Hoare triple {63825#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 101: Hoare triple {63825#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,546 INFO L290 TraceCheckUtils]: 102: Hoare triple {63825#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 103: Hoare triple {63825#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 104: Hoare triple {63825#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 105: Hoare triple {63825#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 106: Hoare triple {63825#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 107: Hoare triple {63825#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 108: Hoare triple {63825#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 109: Hoare triple {63825#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 110: Hoare triple {63825#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 111: Hoare triple {63825#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 112: Hoare triple {63825#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 113: Hoare triple {63825#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,547 INFO L290 TraceCheckUtils]: 114: Hoare triple {63825#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 115: Hoare triple {63825#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 116: Hoare triple {63825#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 117: Hoare triple {63825#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 118: Hoare triple {63825#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 119: Hoare triple {63825#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 120: Hoare triple {63825#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 121: Hoare triple {63825#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 122: Hoare triple {63825#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 123: Hoare triple {63825#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,548 INFO L290 TraceCheckUtils]: 124: Hoare triple {63825#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,549 INFO L290 TraceCheckUtils]: 125: Hoare triple {63825#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {63825#false} is VALID [2022-04-15 11:48:08,549 INFO L290 TraceCheckUtils]: 126: Hoare triple {63825#false} assume 8640 == #t~mem75;havoc #t~mem75; {63825#false} is VALID [2022-04-15 11:48:08,549 INFO L290 TraceCheckUtils]: 127: Hoare triple {63825#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {63825#false} is VALID [2022-04-15 11:48:08,549 INFO L290 TraceCheckUtils]: 128: Hoare triple {63825#false} assume !(9 == ~blastFlag~0); {63825#false} is VALID [2022-04-15 11:48:08,549 INFO L290 TraceCheckUtils]: 129: Hoare triple {63825#false} assume !false; {63825#false} is VALID [2022-04-15 11:48:08,549 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-15 11:48:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740416718] [2022-04-15 11:48:08,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740416718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:08,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:08,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:08,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251645088] [2022-04-15 11:48:08,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251645088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:08,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:08,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515871641] [2022-04-15 11:48:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:08,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 11:48:08,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:08,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:08,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:08,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:08,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:08,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:08,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:08,650 INFO L87 Difference]: Start difference. First operand 447 states and 685 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:10,149 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-15 11:48:13,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:16,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:17,470 INFO L93 Difference]: Finished difference Result 915 states and 1405 transitions. [2022-04-15 11:48:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 11:48:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2022-04-15 11:48:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2022-04-15 11:48:17,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 547 transitions. [2022-04-15 11:48:17,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:17,770 INFO L225 Difference]: With dead ends: 915 [2022-04-15 11:48:17,770 INFO L226 Difference]: Without dead ends: 494 [2022-04-15 11:48:17,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:17,771 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 67 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:17,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 495 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 500 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 11:48:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-04-15 11:48:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 450. [2022-04-15 11:48:17,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:17,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 494 states. Second operand has 450 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 445 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:17,819 INFO L74 IsIncluded]: Start isIncluded. First operand 494 states. Second operand has 450 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 445 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:17,820 INFO L87 Difference]: Start difference. First operand 494 states. Second operand has 450 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 445 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:17,831 INFO L93 Difference]: Finished difference Result 494 states and 749 transitions. [2022-04-15 11:48:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 749 transitions. [2022-04-15 11:48:17,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:17,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:17,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 450 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 445 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 494 states. [2022-04-15 11:48:17,832 INFO L87 Difference]: Start difference. First operand has 450 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 445 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 494 states. [2022-04-15 11:48:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:17,843 INFO L93 Difference]: Finished difference Result 494 states and 749 transitions. [2022-04-15 11:48:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 749 transitions. [2022-04-15 11:48:17,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:17,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:17,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:17,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 445 states have internal predecessors, (684), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 688 transitions. [2022-04-15 11:48:17,864 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 688 transitions. Word has length 130 [2022-04-15 11:48:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:17,864 INFO L478 AbstractCegarLoop]: Abstraction has 450 states and 688 transitions. [2022-04-15 11:48:17,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:17,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 450 states and 688 transitions. [2022-04-15 11:48:18,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 688 edges. 688 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 688 transitions. [2022-04-15 11:48:18,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 11:48:18,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:18,360 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:18,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:48:18,360 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:18,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1289249267, now seen corresponding path program 1 times [2022-04-15 11:48:18,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:18,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [748092752] [2022-04-15 11:48:18,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:18,445 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:18,445 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1289249267, now seen corresponding path program 2 times [2022-04-15 11:48:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:18,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188239658] [2022-04-15 11:48:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:18,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:18,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {67561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {67554#true} is VALID [2022-04-15 11:48:18,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {67554#true} assume true; {67554#true} is VALID [2022-04-15 11:48:18,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67554#true} {67554#true} #705#return; {67554#true} is VALID [2022-04-15 11:48:18,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {67554#true} call ULTIMATE.init(); {67561#(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-15 11:48:18,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {67561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {67554#true} is VALID [2022-04-15 11:48:18,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {67554#true} assume true; {67554#true} is VALID [2022-04-15 11:48:18,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67554#true} {67554#true} #705#return; {67554#true} is VALID [2022-04-15 11:48:18,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {67554#true} call #t~ret161 := main(); {67554#true} is VALID [2022-04-15 11:48:18,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {67554#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {67554#true} is VALID [2022-04-15 11:48:18,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {67554#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,562 INFO L272 TraceCheckUtils]: 7: Hoare triple {67554#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {67554#true} is VALID [2022-04-15 11:48:18,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {67554#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {67554#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {67554#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {67554#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {67554#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {67554#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {67554#true} assume !false; {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {67554#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {67554#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {67554#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {67554#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {67554#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {67554#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {67554#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {67554#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {67554#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {67554#true} assume 8464 == #t~mem55;havoc #t~mem55; {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {67554#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {67554#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {67554#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {67554#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {67554#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {67554#true} ~skip~0 := 0; {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {67554#true} assume !false; {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {67554#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {67554#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {67554#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {67554#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {67554#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {67554#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {67554#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {67554#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {67554#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {67554#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {67554#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {67554#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {67554#true} assume 8496 == #t~mem58;havoc #t~mem58; {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {67554#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {67554#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {67554#true} is VALID [2022-04-15 11:48:18,565 INFO L290 TraceCheckUtils]: 47: Hoare triple {67554#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {67554#true} is VALID [2022-04-15 11:48:18,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {67554#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:18,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:18,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:18,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:18,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:18,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:18,568 INFO L290 TraceCheckUtils]: 54: Hoare triple {67559#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67560#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 11:48:18,568 INFO L290 TraceCheckUtils]: 55: Hoare triple {67560#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {67555#false} is VALID [2022-04-15 11:48:18,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {67555#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {67555#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {67555#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 59: Hoare triple {67555#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 60: Hoare triple {67555#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {67555#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {67555#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 63: Hoare triple {67555#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {67555#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {67555#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 66: Hoare triple {67555#false} ~skip~0 := 0; {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 67: Hoare triple {67555#false} assume !false; {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 68: Hoare triple {67555#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 69: Hoare triple {67555#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 70: Hoare triple {67555#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 71: Hoare triple {67555#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {67555#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {67555#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 74: Hoare triple {67555#false} assume 8480 == #t~mem52;havoc #t~mem52; {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 75: Hoare triple {67555#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {67555#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 77: Hoare triple {67555#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 78: Hoare triple {67555#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 79: Hoare triple {67555#false} ~skip~0 := 0; {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {67555#false} assume !false; {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {67555#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {67555#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {67555#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {67555#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {67555#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,570 INFO L290 TraceCheckUtils]: 86: Hoare triple {67555#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 87: Hoare triple {67555#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 88: Hoare triple {67555#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 89: Hoare triple {67555#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 90: Hoare triple {67555#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 91: Hoare triple {67555#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 92: Hoare triple {67555#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 93: Hoare triple {67555#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 94: Hoare triple {67555#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 95: Hoare triple {67555#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 96: Hoare triple {67555#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 97: Hoare triple {67555#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 98: Hoare triple {67555#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 99: Hoare triple {67555#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,571 INFO L290 TraceCheckUtils]: 100: Hoare triple {67555#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 101: Hoare triple {67555#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 102: Hoare triple {67555#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 103: Hoare triple {67555#false} assume 8448 == #t~mem68;havoc #t~mem68; {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 104: Hoare triple {67555#false} assume !(~num1~0 > 0); {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 105: Hoare triple {67555#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 106: Hoare triple {67555#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 107: Hoare triple {67555#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 108: Hoare triple {67555#false} ~skip~0 := 0; {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 109: Hoare triple {67555#false} assume !false; {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 110: Hoare triple {67555#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 111: Hoare triple {67555#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 112: Hoare triple {67555#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,572 INFO L290 TraceCheckUtils]: 113: Hoare triple {67555#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 114: Hoare triple {67555#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 115: Hoare triple {67555#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 116: Hoare triple {67555#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 117: Hoare triple {67555#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 118: Hoare triple {67555#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 119: Hoare triple {67555#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 120: Hoare triple {67555#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 121: Hoare triple {67555#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 122: Hoare triple {67555#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 123: Hoare triple {67555#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 124: Hoare triple {67555#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 125: Hoare triple {67555#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 126: Hoare triple {67555#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,573 INFO L290 TraceCheckUtils]: 127: Hoare triple {67555#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 128: Hoare triple {67555#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 129: Hoare triple {67555#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 130: Hoare triple {67555#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 131: Hoare triple {67555#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 132: Hoare triple {67555#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 133: Hoare triple {67555#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 134: Hoare triple {67555#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 135: Hoare triple {67555#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 136: Hoare triple {67555#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 137: Hoare triple {67555#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 138: Hoare triple {67555#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 139: Hoare triple {67555#false} assume 8640 == #t~mem75;havoc #t~mem75; {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 140: Hoare triple {67555#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {67555#false} is VALID [2022-04-15 11:48:18,574 INFO L290 TraceCheckUtils]: 141: Hoare triple {67555#false} assume !(9 == ~blastFlag~0); {67555#false} is VALID [2022-04-15 11:48:18,575 INFO L290 TraceCheckUtils]: 142: Hoare triple {67555#false} assume !false; {67555#false} is VALID [2022-04-15 11:48:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:48:18,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:18,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188239658] [2022-04-15 11:48:18,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188239658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:18,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:18,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:18,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:18,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [748092752] [2022-04-15 11:48:18,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [748092752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:18,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:18,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:18,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622454976] [2022-04-15 11:48:18,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:18,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-15 11:48:18,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:18,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:18,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:18,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:18,653 INFO L87 Difference]: Start difference. First operand 450 states and 688 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:20,929 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-15 11:48:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:27,775 INFO L93 Difference]: Finished difference Result 943 states and 1446 transitions. [2022-04-15 11:48:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:27,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-15 11:48:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-15 11:48:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-15 11:48:27,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-15 11:48:28,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:28,131 INFO L225 Difference]: With dead ends: 943 [2022-04-15 11:48:28,132 INFO L226 Difference]: Without dead ends: 519 [2022-04-15 11:48:28,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:28,133 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 143 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:28,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 394 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:48:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-04-15 11:48:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 450. [2022-04-15 11:48:28,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:28,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 519 states. Second operand has 450 states, 445 states have (on average 1.5191011235955056) internal successors, (676), 445 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:28,175 INFO L74 IsIncluded]: Start isIncluded. First operand 519 states. Second operand has 450 states, 445 states have (on average 1.5191011235955056) internal successors, (676), 445 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:28,176 INFO L87 Difference]: Start difference. First operand 519 states. Second operand has 450 states, 445 states have (on average 1.5191011235955056) internal successors, (676), 445 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:28,188 INFO L93 Difference]: Finished difference Result 519 states and 780 transitions. [2022-04-15 11:48:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 780 transitions. [2022-04-15 11:48:28,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:28,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:28,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 450 states, 445 states have (on average 1.5191011235955056) internal successors, (676), 445 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 519 states. [2022-04-15 11:48:28,189 INFO L87 Difference]: Start difference. First operand has 450 states, 445 states have (on average 1.5191011235955056) internal successors, (676), 445 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 519 states. [2022-04-15 11:48:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:28,202 INFO L93 Difference]: Finished difference Result 519 states and 780 transitions. [2022-04-15 11:48:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 780 transitions. [2022-04-15 11:48:28,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:28,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:28,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:28,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 445 states have (on average 1.5191011235955056) internal successors, (676), 445 states have internal predecessors, (676), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 680 transitions. [2022-04-15 11:48:28,227 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 680 transitions. Word has length 143 [2022-04-15 11:48:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:28,227 INFO L478 AbstractCegarLoop]: Abstraction has 450 states and 680 transitions. [2022-04-15 11:48:28,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:28,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 450 states and 680 transitions. [2022-04-15 11:48:28,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 680 edges. 680 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 680 transitions. [2022-04-15 11:48:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 11:48:28,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:28,807 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:28,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:48:28,807 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1168543706, now seen corresponding path program 1 times [2022-04-15 11:48:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:28,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [258953082] [2022-04-15 11:48:28,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:28,888 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:28,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1168543706, now seen corresponding path program 2 times [2022-04-15 11:48:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:28,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945255725] [2022-04-15 11:48:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:28,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {71397#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {71390#true} is VALID [2022-04-15 11:48:28,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {71390#true} assume true; {71390#true} is VALID [2022-04-15 11:48:28,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71390#true} {71390#true} #705#return; {71390#true} is VALID [2022-04-15 11:48:28,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {71390#true} call ULTIMATE.init(); {71397#(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-15 11:48:28,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {71397#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {71390#true} is VALID [2022-04-15 11:48:28,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {71390#true} assume true; {71390#true} is VALID [2022-04-15 11:48:28,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71390#true} {71390#true} #705#return; {71390#true} is VALID [2022-04-15 11:48:28,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {71390#true} call #t~ret161 := main(); {71390#true} is VALID [2022-04-15 11:48:28,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {71390#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {71390#true} is VALID [2022-04-15 11:48:28,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {71390#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,997 INFO L272 TraceCheckUtils]: 7: Hoare triple {71390#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {71390#true} is VALID [2022-04-15 11:48:28,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {71390#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {71390#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {71390#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {71390#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {71390#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {71390#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {71390#true} assume !false; {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {71390#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {71390#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {71390#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {71390#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {71390#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {71390#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {71390#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {71390#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {71390#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {71390#true} assume 8464 == #t~mem55;havoc #t~mem55; {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {71390#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {71390#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {71390#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {71390#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {71390#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {71390#true} ~skip~0 := 0; {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {71390#true} assume !false; {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {71390#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {71390#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {71390#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {71390#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:28,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {71390#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {71390#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {71390#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {71390#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {71390#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {71390#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {71390#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {71390#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {71390#true} assume 8496 == #t~mem58;havoc #t~mem58; {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {71390#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {71390#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {71390#true} is VALID [2022-04-15 11:48:29,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {71390#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {71390#true} is VALID [2022-04-15 11:48:29,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {71390#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,002 INFO L290 TraceCheckUtils]: 51: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,003 INFO L290 TraceCheckUtils]: 52: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,003 INFO L290 TraceCheckUtils]: 54: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,003 INFO L290 TraceCheckUtils]: 55: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,005 INFO L290 TraceCheckUtils]: 59: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,005 INFO L290 TraceCheckUtils]: 61: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,006 INFO L290 TraceCheckUtils]: 64: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,007 INFO L290 TraceCheckUtils]: 67: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,008 INFO L290 TraceCheckUtils]: 68: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,008 INFO L290 TraceCheckUtils]: 69: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,008 INFO L290 TraceCheckUtils]: 70: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,009 INFO L290 TraceCheckUtils]: 71: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,009 INFO L290 TraceCheckUtils]: 72: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:29,009 INFO L290 TraceCheckUtils]: 73: Hoare triple {71395#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {71396#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-15 11:48:29,010 INFO L290 TraceCheckUtils]: 74: Hoare triple {71396#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {71391#false} is VALID [2022-04-15 11:48:29,010 INFO L290 TraceCheckUtils]: 75: Hoare triple {71391#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {71391#false} is VALID [2022-04-15 11:48:29,014 INFO L290 TraceCheckUtils]: 76: Hoare triple {71391#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {71391#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,014 INFO L290 TraceCheckUtils]: 78: Hoare triple {71391#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71391#false} is VALID [2022-04-15 11:48:29,014 INFO L290 TraceCheckUtils]: 79: Hoare triple {71391#false} ~skip~0 := 0; {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 80: Hoare triple {71391#false} assume !false; {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 81: Hoare triple {71391#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 82: Hoare triple {71391#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 83: Hoare triple {71391#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 84: Hoare triple {71391#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 85: Hoare triple {71391#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 86: Hoare triple {71391#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 87: Hoare triple {71391#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 88: Hoare triple {71391#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 89: Hoare triple {71391#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 90: Hoare triple {71391#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 91: Hoare triple {71391#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 92: Hoare triple {71391#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,015 INFO L290 TraceCheckUtils]: 93: Hoare triple {71391#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 94: Hoare triple {71391#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 95: Hoare triple {71391#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 96: Hoare triple {71391#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 97: Hoare triple {71391#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 98: Hoare triple {71391#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 99: Hoare triple {71391#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 100: Hoare triple {71391#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 101: Hoare triple {71391#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 102: Hoare triple {71391#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 103: Hoare triple {71391#false} assume 8448 == #t~mem68;havoc #t~mem68; {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 104: Hoare triple {71391#false} assume !(~num1~0 > 0); {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 105: Hoare triple {71391#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {71391#false} is VALID [2022-04-15 11:48:29,016 INFO L290 TraceCheckUtils]: 106: Hoare triple {71391#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 107: Hoare triple {71391#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 108: Hoare triple {71391#false} ~skip~0 := 0; {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 109: Hoare triple {71391#false} assume !false; {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 110: Hoare triple {71391#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 111: Hoare triple {71391#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 112: Hoare triple {71391#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 113: Hoare triple {71391#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 114: Hoare triple {71391#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 115: Hoare triple {71391#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 116: Hoare triple {71391#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 117: Hoare triple {71391#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 118: Hoare triple {71391#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 119: Hoare triple {71391#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,017 INFO L290 TraceCheckUtils]: 120: Hoare triple {71391#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 121: Hoare triple {71391#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 122: Hoare triple {71391#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 123: Hoare triple {71391#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 124: Hoare triple {71391#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 125: Hoare triple {71391#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 126: Hoare triple {71391#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 127: Hoare triple {71391#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 128: Hoare triple {71391#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 129: Hoare triple {71391#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 130: Hoare triple {71391#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 131: Hoare triple {71391#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 132: Hoare triple {71391#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 133: Hoare triple {71391#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,018 INFO L290 TraceCheckUtils]: 134: Hoare triple {71391#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L290 TraceCheckUtils]: 135: Hoare triple {71391#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L290 TraceCheckUtils]: 136: Hoare triple {71391#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L290 TraceCheckUtils]: 137: Hoare triple {71391#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L290 TraceCheckUtils]: 138: Hoare triple {71391#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L290 TraceCheckUtils]: 139: Hoare triple {71391#false} assume 8640 == #t~mem75;havoc #t~mem75; {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L290 TraceCheckUtils]: 140: Hoare triple {71391#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L290 TraceCheckUtils]: 141: Hoare triple {71391#false} assume !(9 == ~blastFlag~0); {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L290 TraceCheckUtils]: 142: Hoare triple {71391#false} assume !false; {71391#false} is VALID [2022-04-15 11:48:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:48:29,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:29,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945255725] [2022-04-15 11:48:29,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945255725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:29,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:29,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:29,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:29,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [258953082] [2022-04-15 11:48:29,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [258953082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:29,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:29,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619920893] [2022-04-15 11:48:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:29,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-15 11:48:29,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:29,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:29,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:29,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:29,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:29,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:29,097 INFO L87 Difference]: Start difference. First operand 450 states and 680 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:32,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:35,503 INFO L93 Difference]: Finished difference Result 983 states and 1493 transitions. [2022-04-15 11:48:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:35,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-15 11:48:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-15 11:48:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-15 11:48:35,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-15 11:48:35,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:35,922 INFO L225 Difference]: With dead ends: 983 [2022-04-15 11:48:35,922 INFO L226 Difference]: Without dead ends: 559 [2022-04-15 11:48:35,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:35,923 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 123 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:35,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 394 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 11:48:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-15 11:48:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 480. [2022-04-15 11:48:35,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:35,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 480 states, 475 states have (on average 1.5094736842105263) internal successors, (717), 475 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:35,946 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 480 states, 475 states have (on average 1.5094736842105263) internal successors, (717), 475 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:35,947 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 480 states, 475 states have (on average 1.5094736842105263) internal successors, (717), 475 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:35,961 INFO L93 Difference]: Finished difference Result 559 states and 837 transitions. [2022-04-15 11:48:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 837 transitions. [2022-04-15 11:48:35,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:35,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:35,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 480 states, 475 states have (on average 1.5094736842105263) internal successors, (717), 475 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 559 states. [2022-04-15 11:48:35,962 INFO L87 Difference]: Start difference. First operand has 480 states, 475 states have (on average 1.5094736842105263) internal successors, (717), 475 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 559 states. [2022-04-15 11:48:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:35,976 INFO L93 Difference]: Finished difference Result 559 states and 837 transitions. [2022-04-15 11:48:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 837 transitions. [2022-04-15 11:48:35,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:35,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:35,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:35,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 475 states have (on average 1.5094736842105263) internal successors, (717), 475 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 721 transitions. [2022-04-15 11:48:35,993 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 721 transitions. Word has length 143 [2022-04-15 11:48:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:35,994 INFO L478 AbstractCegarLoop]: Abstraction has 480 states and 721 transitions. [2022-04-15 11:48:35,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:35,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 480 states and 721 transitions. [2022-04-15 11:48:36,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 721 edges. 721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 721 transitions. [2022-04-15 11:48:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 11:48:36,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:36,641 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:36,641 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:48:36,641 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:36,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1081677761, now seen corresponding path program 1 times [2022-04-15 11:48:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:36,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1973255925] [2022-04-15 11:48:36,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:36,722 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:36,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1081677761, now seen corresponding path program 2 times [2022-04-15 11:48:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:36,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480647057] [2022-04-15 11:48:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:36,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {75453#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {75446#true} is VALID [2022-04-15 11:48:36,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {75446#true} assume true; {75446#true} is VALID [2022-04-15 11:48:36,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75446#true} {75446#true} #705#return; {75446#true} is VALID [2022-04-15 11:48:36,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {75446#true} call ULTIMATE.init(); {75453#(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-15 11:48:36,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {75453#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {75446#true} is VALID [2022-04-15 11:48:36,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {75446#true} assume true; {75446#true} is VALID [2022-04-15 11:48:36,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75446#true} {75446#true} #705#return; {75446#true} is VALID [2022-04-15 11:48:36,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {75446#true} call #t~ret161 := main(); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {75446#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {75446#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L272 TraceCheckUtils]: 7: Hoare triple {75446#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {75446#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {75446#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {75446#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {75446#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {75446#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {75446#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {75446#true} assume !false; {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {75446#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {75446#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {75446#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {75446#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {75446#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {75446#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {75446#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {75446#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {75446#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {75446#true} assume 8464 == #t~mem55;havoc #t~mem55; {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {75446#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {75446#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {75446#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {75446#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {75446#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {75446#true} ~skip~0 := 0; {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {75446#true} assume !false; {75446#true} is VALID [2022-04-15 11:48:36,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {75446#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {75446#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {75446#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {75446#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {75446#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {75446#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {75446#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {75446#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {75446#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {75446#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {75446#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {75446#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {75446#true} assume 8496 == #t~mem58;havoc #t~mem58; {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {75446#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {75446#true} is VALID [2022-04-15 11:48:36,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {75446#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {75446#true} is VALID [2022-04-15 11:48:36,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {75446#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {75446#true} is VALID [2022-04-15 11:48:36,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {75446#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,828 INFO L290 TraceCheckUtils]: 61: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,829 INFO L290 TraceCheckUtils]: 64: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,829 INFO L290 TraceCheckUtils]: 66: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,830 INFO L290 TraceCheckUtils]: 67: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,830 INFO L290 TraceCheckUtils]: 69: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,831 INFO L290 TraceCheckUtils]: 71: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,831 INFO L290 TraceCheckUtils]: 72: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:36,832 INFO L290 TraceCheckUtils]: 74: Hoare triple {75451#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {75452#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-15 11:48:36,832 INFO L290 TraceCheckUtils]: 75: Hoare triple {75452#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {75447#false} is VALID [2022-04-15 11:48:36,832 INFO L290 TraceCheckUtils]: 76: Hoare triple {75447#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {75447#false} is VALID [2022-04-15 11:48:36,832 INFO L290 TraceCheckUtils]: 77: Hoare triple {75447#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,832 INFO L290 TraceCheckUtils]: 78: Hoare triple {75447#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,832 INFO L290 TraceCheckUtils]: 79: Hoare triple {75447#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 80: Hoare triple {75447#false} ~skip~0 := 0; {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 81: Hoare triple {75447#false} assume !false; {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 82: Hoare triple {75447#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 83: Hoare triple {75447#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 84: Hoare triple {75447#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 85: Hoare triple {75447#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 86: Hoare triple {75447#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 87: Hoare triple {75447#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 88: Hoare triple {75447#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 89: Hoare triple {75447#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 90: Hoare triple {75447#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 91: Hoare triple {75447#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 92: Hoare triple {75447#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 93: Hoare triple {75447#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,833 INFO L290 TraceCheckUtils]: 94: Hoare triple {75447#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 95: Hoare triple {75447#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 96: Hoare triple {75447#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 97: Hoare triple {75447#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 98: Hoare triple {75447#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 99: Hoare triple {75447#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 100: Hoare triple {75447#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 101: Hoare triple {75447#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 102: Hoare triple {75447#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 103: Hoare triple {75447#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 104: Hoare triple {75447#false} assume 8448 == #t~mem68;havoc #t~mem68; {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 105: Hoare triple {75447#false} assume !(~num1~0 > 0); {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 106: Hoare triple {75447#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {75447#false} is VALID [2022-04-15 11:48:36,834 INFO L290 TraceCheckUtils]: 107: Hoare triple {75447#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 108: Hoare triple {75447#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 109: Hoare triple {75447#false} ~skip~0 := 0; {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 110: Hoare triple {75447#false} assume !false; {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 111: Hoare triple {75447#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 112: Hoare triple {75447#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 113: Hoare triple {75447#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 114: Hoare triple {75447#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 115: Hoare triple {75447#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 116: Hoare triple {75447#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 117: Hoare triple {75447#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 118: Hoare triple {75447#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 119: Hoare triple {75447#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 120: Hoare triple {75447#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,835 INFO L290 TraceCheckUtils]: 121: Hoare triple {75447#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 122: Hoare triple {75447#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 123: Hoare triple {75447#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 124: Hoare triple {75447#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 125: Hoare triple {75447#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 126: Hoare triple {75447#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 127: Hoare triple {75447#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 128: Hoare triple {75447#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 129: Hoare triple {75447#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 130: Hoare triple {75447#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 131: Hoare triple {75447#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 132: Hoare triple {75447#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 133: Hoare triple {75447#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 134: Hoare triple {75447#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,836 INFO L290 TraceCheckUtils]: 135: Hoare triple {75447#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L290 TraceCheckUtils]: 136: Hoare triple {75447#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L290 TraceCheckUtils]: 137: Hoare triple {75447#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L290 TraceCheckUtils]: 138: Hoare triple {75447#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L290 TraceCheckUtils]: 139: Hoare triple {75447#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L290 TraceCheckUtils]: 140: Hoare triple {75447#false} assume 8640 == #t~mem75;havoc #t~mem75; {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L290 TraceCheckUtils]: 141: Hoare triple {75447#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L290 TraceCheckUtils]: 142: Hoare triple {75447#false} assume !(9 == ~blastFlag~0); {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L290 TraceCheckUtils]: 143: Hoare triple {75447#false} assume !false; {75447#false} is VALID [2022-04-15 11:48:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:48:36,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:36,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480647057] [2022-04-15 11:48:36,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480647057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:36,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:36,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:36,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:36,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1973255925] [2022-04-15 11:48:36,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1973255925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:36,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:36,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:36,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469008586] [2022-04-15 11:48:36,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:36,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-15 11:48:36,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:36,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:36,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:36,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:36,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:36,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:36,902 INFO L87 Difference]: Start difference. First operand 480 states and 721 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:44,400 INFO L93 Difference]: Finished difference Result 1003 states and 1512 transitions. [2022-04-15 11:48:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:44,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-15 11:48:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-15 11:48:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-15 11:48:44,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-15 11:48:44,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:44,821 INFO L225 Difference]: With dead ends: 1003 [2022-04-15 11:48:44,822 INFO L226 Difference]: Without dead ends: 549 [2022-04-15 11:48:44,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:44,823 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 122 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:44,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 378 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:48:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-04-15 11:48:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 480. [2022-04-15 11:48:44,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:44,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 549 states. Second operand has 480 states, 475 states have (on average 1.496842105263158) internal successors, (711), 475 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,866 INFO L74 IsIncluded]: Start isIncluded. First operand 549 states. Second operand has 480 states, 475 states have (on average 1.496842105263158) internal successors, (711), 475 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,866 INFO L87 Difference]: Start difference. First operand 549 states. Second operand has 480 states, 475 states have (on average 1.496842105263158) internal successors, (711), 475 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:44,880 INFO L93 Difference]: Finished difference Result 549 states and 815 transitions. [2022-04-15 11:48:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 815 transitions. [2022-04-15 11:48:44,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:44,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:44,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 480 states, 475 states have (on average 1.496842105263158) internal successors, (711), 475 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 549 states. [2022-04-15 11:48:44,881 INFO L87 Difference]: Start difference. First operand has 480 states, 475 states have (on average 1.496842105263158) internal successors, (711), 475 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 549 states. [2022-04-15 11:48:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:44,895 INFO L93 Difference]: Finished difference Result 549 states and 815 transitions. [2022-04-15 11:48:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 815 transitions. [2022-04-15 11:48:44,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:44,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:44,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:44,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 475 states have (on average 1.496842105263158) internal successors, (711), 475 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 715 transitions. [2022-04-15 11:48:44,912 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 715 transitions. Word has length 144 [2022-04-15 11:48:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:44,912 INFO L478 AbstractCegarLoop]: Abstraction has 480 states and 715 transitions. [2022-04-15 11:48:44,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 480 states and 715 transitions. [2022-04-15 11:48:45,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 715 edges. 715 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 715 transitions. [2022-04-15 11:48:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:48:45,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:45,355 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:45,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 11:48:45,356 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:45,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash -691185286, now seen corresponding path program 1 times [2022-04-15 11:48:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:45,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710160465] [2022-04-15 11:48:45,446 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:45,446 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:45,446 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash -691185286, now seen corresponding path program 2 times [2022-04-15 11:48:45,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:45,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220569259] [2022-04-15 11:48:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:45,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {79529#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {79522#true} is VALID [2022-04-15 11:48:45,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {79522#true} assume true; {79522#true} is VALID [2022-04-15 11:48:45,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79522#true} {79522#true} #705#return; {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {79522#true} call ULTIMATE.init(); {79529#(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-15 11:48:45,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {79529#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {79522#true} assume true; {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79522#true} {79522#true} #705#return; {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {79522#true} call #t~ret161 := main(); {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {79522#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {79522#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L272 TraceCheckUtils]: 7: Hoare triple {79522#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {79522#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {79522#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {79522#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {79522#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {79522#true} is VALID [2022-04-15 11:48:45,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {79522#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {79522#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {79522#true} assume !false; {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {79522#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {79522#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {79522#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {79522#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {79522#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {79522#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {79522#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {79522#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {79522#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {79522#true} assume 8464 == #t~mem55;havoc #t~mem55; {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {79522#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {79522#true} is VALID [2022-04-15 11:48:45,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {79522#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {79522#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {79522#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {79522#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {79522#true} ~skip~0 := 0; {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {79522#true} assume !false; {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {79522#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {79522#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {79522#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {79522#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {79522#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {79522#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {79522#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {79522#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {79522#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {79522#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {79522#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {79522#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {79522#true} assume 8496 == #t~mem58;havoc #t~mem58; {79522#true} is VALID [2022-04-15 11:48:45,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {79522#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {79522#true} is VALID [2022-04-15 11:48:45,589 INFO L290 TraceCheckUtils]: 46: Hoare triple {79522#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {79522#true} is VALID [2022-04-15 11:48:45,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {79522#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {79522#true} is VALID [2022-04-15 11:48:45,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {79522#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} ~skip~0 := 0; {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !false; {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:48:45,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {79527#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79528#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-15 11:48:45,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {79528#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {79523#false} is VALID [2022-04-15 11:48:45,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {79523#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {79523#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {79523#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {79523#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {79523#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {79523#false} ~skip~0 := 0; {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {79523#false} assume !false; {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {79523#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 77: Hoare triple {79523#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 78: Hoare triple {79523#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 79: Hoare triple {79523#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 80: Hoare triple {79523#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 81: Hoare triple {79523#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 82: Hoare triple {79523#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,597 INFO L290 TraceCheckUtils]: 83: Hoare triple {79523#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 84: Hoare triple {79523#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 85: Hoare triple {79523#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 86: Hoare triple {79523#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 87: Hoare triple {79523#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 88: Hoare triple {79523#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 89: Hoare triple {79523#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 90: Hoare triple {79523#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 91: Hoare triple {79523#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 92: Hoare triple {79523#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 93: Hoare triple {79523#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 94: Hoare triple {79523#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 95: Hoare triple {79523#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 96: Hoare triple {79523#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,598 INFO L290 TraceCheckUtils]: 97: Hoare triple {79523#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 98: Hoare triple {79523#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 99: Hoare triple {79523#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 100: Hoare triple {79523#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 101: Hoare triple {79523#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 102: Hoare triple {79523#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 103: Hoare triple {79523#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 104: Hoare triple {79523#false} assume 8609 == #t~mem74;havoc #t~mem74; {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 105: Hoare triple {79523#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 106: Hoare triple {79523#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 107: Hoare triple {79523#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 108: Hoare triple {79523#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 109: Hoare triple {79523#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 110: Hoare triple {79523#false} ~skip~0 := 0; {79523#false} is VALID [2022-04-15 11:48:45,599 INFO L290 TraceCheckUtils]: 111: Hoare triple {79523#false} assume !false; {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 112: Hoare triple {79523#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 113: Hoare triple {79523#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 114: Hoare triple {79523#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 115: Hoare triple {79523#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 116: Hoare triple {79523#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 117: Hoare triple {79523#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 118: Hoare triple {79523#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 119: Hoare triple {79523#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 120: Hoare triple {79523#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 121: Hoare triple {79523#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 122: Hoare triple {79523#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 123: Hoare triple {79523#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 124: Hoare triple {79523#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 125: Hoare triple {79523#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,600 INFO L290 TraceCheckUtils]: 126: Hoare triple {79523#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 127: Hoare triple {79523#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 128: Hoare triple {79523#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 129: Hoare triple {79523#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 130: Hoare triple {79523#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 131: Hoare triple {79523#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 132: Hoare triple {79523#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 133: Hoare triple {79523#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 134: Hoare triple {79523#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 135: Hoare triple {79523#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 136: Hoare triple {79523#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 137: Hoare triple {79523#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 138: Hoare triple {79523#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 139: Hoare triple {79523#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,601 INFO L290 TraceCheckUtils]: 140: Hoare triple {79523#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {79523#false} is VALID [2022-04-15 11:48:45,602 INFO L290 TraceCheckUtils]: 141: Hoare triple {79523#false} assume 8640 == #t~mem75;havoc #t~mem75; {79523#false} is VALID [2022-04-15 11:48:45,602 INFO L290 TraceCheckUtils]: 142: Hoare triple {79523#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {79523#false} is VALID [2022-04-15 11:48:45,602 INFO L290 TraceCheckUtils]: 143: Hoare triple {79523#false} assume !(9 == ~blastFlag~0); {79523#false} is VALID [2022-04-15 11:48:45,602 INFO L290 TraceCheckUtils]: 144: Hoare triple {79523#false} assume !false; {79523#false} is VALID [2022-04-15 11:48:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:48:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:45,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220569259] [2022-04-15 11:48:45,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220569259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:45,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:45,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:45,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:45,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710160465] [2022-04-15 11:48:45,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710160465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:45,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:45,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:45,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751822564] [2022-04-15 11:48:45,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:48:45,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:45,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:45,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:45,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:45,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:45,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:45,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:45,677 INFO L87 Difference]: Start difference. First operand 480 states and 715 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:47,413 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-15 11:48:52,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:53,666 INFO L93 Difference]: Finished difference Result 1003 states and 1500 transitions. [2022-04-15 11:48:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:48:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-15 11:48:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-15 11:48:53,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-15 11:48:54,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:54,120 INFO L225 Difference]: With dead ends: 1003 [2022-04-15 11:48:54,120 INFO L226 Difference]: Without dead ends: 549 [2022-04-15 11:48:54,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:54,121 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 128 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:54,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 392 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:48:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-04-15 11:48:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 480. [2022-04-15 11:48:54,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:54,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 549 states. Second operand has 480 states, 475 states have (on average 1.4821052631578948) internal successors, (704), 475 states have internal predecessors, (704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,155 INFO L74 IsIncluded]: Start isIncluded. First operand 549 states. Second operand has 480 states, 475 states have (on average 1.4821052631578948) internal successors, (704), 475 states have internal predecessors, (704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,156 INFO L87 Difference]: Start difference. First operand 549 states. Second operand has 480 states, 475 states have (on average 1.4821052631578948) internal successors, (704), 475 states have internal predecessors, (704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:54,172 INFO L93 Difference]: Finished difference Result 549 states and 808 transitions. [2022-04-15 11:48:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 808 transitions. [2022-04-15 11:48:54,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:54,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:54,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 480 states, 475 states have (on average 1.4821052631578948) internal successors, (704), 475 states have internal predecessors, (704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 549 states. [2022-04-15 11:48:54,173 INFO L87 Difference]: Start difference. First operand has 480 states, 475 states have (on average 1.4821052631578948) internal successors, (704), 475 states have internal predecessors, (704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 549 states. [2022-04-15 11:48:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:54,187 INFO L93 Difference]: Finished difference Result 549 states and 808 transitions. [2022-04-15 11:48:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 808 transitions. [2022-04-15 11:48:54,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:54,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:54,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:54,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 475 states have (on average 1.4821052631578948) internal successors, (704), 475 states have internal predecessors, (704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 708 transitions. [2022-04-15 11:48:54,204 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 708 transitions. Word has length 145 [2022-04-15 11:48:54,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:54,204 INFO L478 AbstractCegarLoop]: Abstraction has 480 states and 708 transitions. [2022-04-15 11:48:54,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 480 states and 708 transitions. [2022-04-15 11:48:54,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 708 transitions. [2022-04-15 11:48:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:48:54,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:54,875 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:54,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 11:48:54,875 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 909885820, now seen corresponding path program 1 times [2022-04-15 11:48:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:54,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790073903] [2022-04-15 11:48:54,983 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:54,983 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:54,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash 909885820, now seen corresponding path program 2 times [2022-04-15 11:48:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:54,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067533857] [2022-04-15 11:48:54,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:55,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:55,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {83604#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {83598#true} is VALID [2022-04-15 11:48:55,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {83598#true} assume true; {83598#true} is VALID [2022-04-15 11:48:55,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83598#true} {83598#true} #705#return; {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {83598#true} call ULTIMATE.init(); {83604#(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-15 11:48:55,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {83604#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {83598#true} assume true; {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83598#true} {83598#true} #705#return; {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {83598#true} call #t~ret161 := main(); {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {83598#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {83598#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L272 TraceCheckUtils]: 7: Hoare triple {83598#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {83598#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {83598#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {83598#true} is VALID [2022-04-15 11:48:55,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {83598#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {83598#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {83598#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {83598#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {83598#true} assume !false; {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {83598#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {83598#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {83598#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {83598#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {83598#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {83598#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {83598#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {83598#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {83598#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {83598#true} assume 8464 == #t~mem55;havoc #t~mem55; {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {83598#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {83598#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {83598#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {83598#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {83598#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {83598#true} ~skip~0 := 0; {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {83598#true} assume !false; {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {83598#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {83598#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {83598#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {83598#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {83598#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {83598#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {83598#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {83598#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {83598#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {83598#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {83598#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {83598#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83598#true} is VALID [2022-04-15 11:48:55,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {83598#true} assume 8496 == #t~mem58;havoc #t~mem58; {83598#true} is VALID [2022-04-15 11:48:55,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {83598#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {83598#true} is VALID [2022-04-15 11:48:55,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {83598#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,091 INFO L290 TraceCheckUtils]: 61: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,091 INFO L290 TraceCheckUtils]: 62: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,092 INFO L290 TraceCheckUtils]: 63: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,092 INFO L290 TraceCheckUtils]: 64: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,092 INFO L290 TraceCheckUtils]: 65: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,093 INFO L290 TraceCheckUtils]: 67: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,094 INFO L290 TraceCheckUtils]: 71: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,094 INFO L290 TraceCheckUtils]: 72: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,094 INFO L290 TraceCheckUtils]: 73: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,095 INFO L290 TraceCheckUtils]: 74: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,095 INFO L290 TraceCheckUtils]: 76: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,096 INFO L290 TraceCheckUtils]: 78: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,096 INFO L290 TraceCheckUtils]: 79: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,096 INFO L290 TraceCheckUtils]: 80: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,096 INFO L290 TraceCheckUtils]: 81: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,097 INFO L290 TraceCheckUtils]: 82: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,097 INFO L290 TraceCheckUtils]: 83: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,097 INFO L290 TraceCheckUtils]: 84: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,097 INFO L290 TraceCheckUtils]: 85: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,098 INFO L290 TraceCheckUtils]: 86: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,098 INFO L290 TraceCheckUtils]: 87: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,099 INFO L290 TraceCheckUtils]: 90: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,099 INFO L290 TraceCheckUtils]: 91: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,100 INFO L290 TraceCheckUtils]: 94: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,100 INFO L290 TraceCheckUtils]: 95: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,101 INFO L290 TraceCheckUtils]: 98: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,101 INFO L290 TraceCheckUtils]: 99: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,101 INFO L290 TraceCheckUtils]: 100: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,101 INFO L290 TraceCheckUtils]: 101: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,102 INFO L290 TraceCheckUtils]: 102: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,102 INFO L290 TraceCheckUtils]: 103: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,102 INFO L290 TraceCheckUtils]: 104: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume 8609 == #t~mem74;havoc #t~mem74; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 105: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {83603#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 106: Hoare triple {83603#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {83599#false} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 107: Hoare triple {83599#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 108: Hoare triple {83599#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 109: Hoare triple {83599#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83599#false} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 110: Hoare triple {83599#false} ~skip~0 := 0; {83599#false} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 111: Hoare triple {83599#false} assume !false; {83599#false} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 112: Hoare triple {83599#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 113: Hoare triple {83599#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,103 INFO L290 TraceCheckUtils]: 114: Hoare triple {83599#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 115: Hoare triple {83599#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 116: Hoare triple {83599#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 117: Hoare triple {83599#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 118: Hoare triple {83599#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 119: Hoare triple {83599#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 120: Hoare triple {83599#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 121: Hoare triple {83599#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 122: Hoare triple {83599#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 123: Hoare triple {83599#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 124: Hoare triple {83599#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 125: Hoare triple {83599#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 126: Hoare triple {83599#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 127: Hoare triple {83599#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,104 INFO L290 TraceCheckUtils]: 128: Hoare triple {83599#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 129: Hoare triple {83599#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 130: Hoare triple {83599#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 131: Hoare triple {83599#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 132: Hoare triple {83599#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 133: Hoare triple {83599#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 134: Hoare triple {83599#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 135: Hoare triple {83599#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 136: Hoare triple {83599#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 137: Hoare triple {83599#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 138: Hoare triple {83599#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 139: Hoare triple {83599#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 140: Hoare triple {83599#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 141: Hoare triple {83599#false} assume 8640 == #t~mem75;havoc #t~mem75; {83599#false} is VALID [2022-04-15 11:48:55,105 INFO L290 TraceCheckUtils]: 142: Hoare triple {83599#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {83599#false} is VALID [2022-04-15 11:48:55,106 INFO L290 TraceCheckUtils]: 143: Hoare triple {83599#false} assume !(9 == ~blastFlag~0); {83599#false} is VALID [2022-04-15 11:48:55,106 INFO L290 TraceCheckUtils]: 144: Hoare triple {83599#false} assume !false; {83599#false} is VALID [2022-04-15 11:48:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 11:48:55,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:55,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067533857] [2022-04-15 11:48:55,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067533857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:55,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:55,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:48:55,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:55,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790073903] [2022-04-15 11:48:55,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790073903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:55,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:55,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:48:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182171954] [2022-04-15 11:48:55,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:55,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:48:55,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:55,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:55,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:55,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:48:55,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:55,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:48:55,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:48:55,187 INFO L87 Difference]: Start difference. First operand 480 states and 708 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:58,759 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-15 11:49:00,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:01,803 INFO L93 Difference]: Finished difference Result 1383 states and 2058 transitions. [2022-04-15 11:49:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:49:01,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:49:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2022-04-15 11:49:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2022-04-15 11:49:01,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 614 transitions. [2022-04-15 11:49:02,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:02,213 INFO L225 Difference]: With dead ends: 1383 [2022-04-15 11:49:02,213 INFO L226 Difference]: Without dead ends: 929 [2022-04-15 11:49:02,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:49:02,214 INFO L913 BasicCegarLoop]: 239 mSDtfsCounter, 141 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:02,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 433 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 11:49:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-04-15 11:49:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 927. [2022-04-15 11:49:02,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:02,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 929 states. Second operand has 927 states, 922 states have (on average 1.4783080260303687) internal successors, (1363), 922 states have internal predecessors, (1363), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:02,270 INFO L74 IsIncluded]: Start isIncluded. First operand 929 states. Second operand has 927 states, 922 states have (on average 1.4783080260303687) internal successors, (1363), 922 states have internal predecessors, (1363), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:02,270 INFO L87 Difference]: Start difference. First operand 929 states. Second operand has 927 states, 922 states have (on average 1.4783080260303687) internal successors, (1363), 922 states have internal predecessors, (1363), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:02,305 INFO L93 Difference]: Finished difference Result 929 states and 1368 transitions. [2022-04-15 11:49:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1368 transitions. [2022-04-15 11:49:02,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:02,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:02,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 927 states, 922 states have (on average 1.4783080260303687) internal successors, (1363), 922 states have internal predecessors, (1363), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 929 states. [2022-04-15 11:49:02,307 INFO L87 Difference]: Start difference. First operand has 927 states, 922 states have (on average 1.4783080260303687) internal successors, (1363), 922 states have internal predecessors, (1363), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 929 states. [2022-04-15 11:49:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:02,342 INFO L93 Difference]: Finished difference Result 929 states and 1368 transitions. [2022-04-15 11:49:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1368 transitions. [2022-04-15 11:49:02,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:02,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:02,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:02,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 922 states have (on average 1.4783080260303687) internal successors, (1363), 922 states have internal predecessors, (1363), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1367 transitions. [2022-04-15 11:49:02,405 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1367 transitions. Word has length 145 [2022-04-15 11:49:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:02,405 INFO L478 AbstractCegarLoop]: Abstraction has 927 states and 1367 transitions. [2022-04-15 11:49:02,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:02,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 927 states and 1367 transitions. [2022-04-15 11:49:03,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1367 edges. 1367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1367 transitions. [2022-04-15 11:49:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:49:03,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:03,684 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:03,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 11:49:03,684 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -935481346, now seen corresponding path program 1 times [2022-04-15 11:49:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:03,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931102042] [2022-04-15 11:49:03,793 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:03,794 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:03,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -935481346, now seen corresponding path program 2 times [2022-04-15 11:49:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:03,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295858743] [2022-04-15 11:49:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:03,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {90092#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {90085#true} is VALID [2022-04-15 11:49:03,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {90085#true} assume true; {90085#true} is VALID [2022-04-15 11:49:03,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90085#true} {90085#true} #705#return; {90085#true} is VALID [2022-04-15 11:49:03,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {90085#true} call ULTIMATE.init(); {90092#(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-15 11:49:03,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {90092#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {90085#true} is VALID [2022-04-15 11:49:03,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {90085#true} assume true; {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90085#true} {90085#true} #705#return; {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {90085#true} call #t~ret161 := main(); {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {90085#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {90085#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L272 TraceCheckUtils]: 7: Hoare triple {90085#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {90085#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {90085#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {90085#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {90085#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {90085#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {90085#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {90085#true} assume !false; {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {90085#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {90085#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {90085#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {90085#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {90085#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {90085#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {90085#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {90085#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {90085#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {90085#true} assume 8464 == #t~mem55;havoc #t~mem55; {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {90085#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {90085#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {90085#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {90085#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {90085#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90085#true} is VALID [2022-04-15 11:49:03,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {90085#true} ~skip~0 := 0; {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {90085#true} assume !false; {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {90085#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {90085#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {90085#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {90085#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {90085#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {90085#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {90085#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {90085#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {90085#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {90085#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {90085#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {90085#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {90085#true} assume 8496 == #t~mem58;havoc #t~mem58; {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {90085#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {90085#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {90085#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {90085#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {90085#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {90085#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {90085#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {90085#true} ~skip~0 := 0; {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {90085#true} assume !false; {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {90085#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 55: Hoare triple {90085#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {90085#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {90085#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {90085#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {90085#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {90085#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {90085#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {90085#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 63: Hoare triple {90085#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 64: Hoare triple {90085#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {90085#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {90085#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 67: Hoare triple {90085#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 68: Hoare triple {90085#true} assume 8512 == #t~mem60;havoc #t~mem60; {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 69: Hoare triple {90085#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {90085#true} is VALID [2022-04-15 11:49:03,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {90085#true} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {90085#true} is VALID [2022-04-15 11:49:03,903 INFO L290 TraceCheckUtils]: 71: Hoare triple {90085#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,904 INFO L290 TraceCheckUtils]: 72: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,904 INFO L290 TraceCheckUtils]: 73: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,904 INFO L290 TraceCheckUtils]: 74: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,905 INFO L290 TraceCheckUtils]: 76: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,905 INFO L290 TraceCheckUtils]: 77: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,906 INFO L290 TraceCheckUtils]: 78: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,906 INFO L290 TraceCheckUtils]: 79: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,906 INFO L290 TraceCheckUtils]: 80: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,907 INFO L290 TraceCheckUtils]: 82: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,907 INFO L290 TraceCheckUtils]: 83: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,908 INFO L290 TraceCheckUtils]: 85: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,908 INFO L290 TraceCheckUtils]: 86: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,909 INFO L290 TraceCheckUtils]: 87: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,909 INFO L290 TraceCheckUtils]: 88: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,909 INFO L290 TraceCheckUtils]: 89: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,909 INFO L290 TraceCheckUtils]: 90: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:03,910 INFO L290 TraceCheckUtils]: 91: Hoare triple {90090#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {90091#(= |ssl3_accept_#t~mem62| 8528)} is VALID [2022-04-15 11:49:03,910 INFO L290 TraceCheckUtils]: 92: Hoare triple {90091#(= |ssl3_accept_#t~mem62| 8528)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,910 INFO L290 TraceCheckUtils]: 93: Hoare triple {90086#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,910 INFO L290 TraceCheckUtils]: 94: Hoare triple {90086#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,910 INFO L290 TraceCheckUtils]: 95: Hoare triple {90086#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,910 INFO L290 TraceCheckUtils]: 96: Hoare triple {90086#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,910 INFO L290 TraceCheckUtils]: 97: Hoare triple {90086#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 98: Hoare triple {90086#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 99: Hoare triple {90086#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 100: Hoare triple {90086#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 101: Hoare triple {90086#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 102: Hoare triple {90086#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 103: Hoare triple {90086#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 104: Hoare triple {90086#false} assume 8609 == #t~mem74;havoc #t~mem74; {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 105: Hoare triple {90086#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 106: Hoare triple {90086#false} assume !(8 == ~blastFlag~0); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 107: Hoare triple {90086#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 108: Hoare triple {90086#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 109: Hoare triple {90086#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 110: Hoare triple {90086#false} ~skip~0 := 0; {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 111: Hoare triple {90086#false} assume !false; {90086#false} is VALID [2022-04-15 11:49:03,911 INFO L290 TraceCheckUtils]: 112: Hoare triple {90086#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 113: Hoare triple {90086#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 114: Hoare triple {90086#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 115: Hoare triple {90086#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 116: Hoare triple {90086#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 117: Hoare triple {90086#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 118: Hoare triple {90086#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 119: Hoare triple {90086#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 120: Hoare triple {90086#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 121: Hoare triple {90086#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 122: Hoare triple {90086#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 123: Hoare triple {90086#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 124: Hoare triple {90086#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 125: Hoare triple {90086#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,912 INFO L290 TraceCheckUtils]: 126: Hoare triple {90086#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 127: Hoare triple {90086#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 128: Hoare triple {90086#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 129: Hoare triple {90086#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 130: Hoare triple {90086#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 131: Hoare triple {90086#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 132: Hoare triple {90086#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 133: Hoare triple {90086#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 134: Hoare triple {90086#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 135: Hoare triple {90086#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 136: Hoare triple {90086#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 137: Hoare triple {90086#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 138: Hoare triple {90086#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 139: Hoare triple {90086#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 140: Hoare triple {90086#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {90086#false} is VALID [2022-04-15 11:49:03,913 INFO L290 TraceCheckUtils]: 141: Hoare triple {90086#false} assume 8640 == #t~mem75;havoc #t~mem75; {90086#false} is VALID [2022-04-15 11:49:03,914 INFO L290 TraceCheckUtils]: 142: Hoare triple {90086#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {90086#false} is VALID [2022-04-15 11:49:03,914 INFO L290 TraceCheckUtils]: 143: Hoare triple {90086#false} assume !(9 == ~blastFlag~0); {90086#false} is VALID [2022-04-15 11:49:03,914 INFO L290 TraceCheckUtils]: 144: Hoare triple {90086#false} assume !false; {90086#false} is VALID [2022-04-15 11:49:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-15 11:49:03,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:03,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295858743] [2022-04-15 11:49:03,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295858743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:03,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:03,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:03,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:03,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931102042] [2022-04-15 11:49:03,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931102042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:03,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:03,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958847232] [2022-04-15 11:49:03,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:49:03,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:03,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:03,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:03,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:03,988 INFO L87 Difference]: Start difference. First operand 927 states and 1367 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:06,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:12,179 INFO L93 Difference]: Finished difference Result 1907 states and 2816 transitions. [2022-04-15 11:49:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:49:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:49:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:49:12,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-15 11:49:12,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:12,533 INFO L225 Difference]: With dead ends: 1907 [2022-04-15 11:49:12,534 INFO L226 Difference]: Without dead ends: 1006 [2022-04-15 11:49:12,535 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:12,535 INFO L913 BasicCegarLoop]: 242 mSDtfsCounter, 29 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:12,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 601 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 11:49:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2022-04-15 11:49:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 979. [2022-04-15 11:49:12,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:12,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1006 states. Second operand has 979 states, 974 states have (on average 1.4753593429158112) internal successors, (1437), 974 states have internal predecessors, (1437), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:12,589 INFO L74 IsIncluded]: Start isIncluded. First operand 1006 states. Second operand has 979 states, 974 states have (on average 1.4753593429158112) internal successors, (1437), 974 states have internal predecessors, (1437), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:12,589 INFO L87 Difference]: Start difference. First operand 1006 states. Second operand has 979 states, 974 states have (on average 1.4753593429158112) internal successors, (1437), 974 states have internal predecessors, (1437), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:12,630 INFO L93 Difference]: Finished difference Result 1006 states and 1477 transitions. [2022-04-15 11:49:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1477 transitions. [2022-04-15 11:49:12,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:12,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:12,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4753593429158112) internal successors, (1437), 974 states have internal predecessors, (1437), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1006 states. [2022-04-15 11:49:12,633 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4753593429158112) internal successors, (1437), 974 states have internal predecessors, (1437), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1006 states. [2022-04-15 11:49:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:12,673 INFO L93 Difference]: Finished difference Result 1006 states and 1477 transitions. [2022-04-15 11:49:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1477 transitions. [2022-04-15 11:49:12,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:12,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:12,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:12,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4753593429158112) internal successors, (1437), 974 states have internal predecessors, (1437), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1441 transitions. [2022-04-15 11:49:12,762 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1441 transitions. Word has length 145 [2022-04-15 11:49:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:12,762 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1441 transitions. [2022-04-15 11:49:12,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:12,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1441 transitions. [2022-04-15 11:49:13,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1441 edges. 1441 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1441 transitions. [2022-04-15 11:49:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:49:13,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:13,930 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:13,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 11:49:13,930 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:13,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1583670423, now seen corresponding path program 1 times [2022-04-15 11:49:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:13,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [421247342] [2022-04-15 11:49:14,046 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:14,046 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:14,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:14,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1583670423, now seen corresponding path program 2 times [2022-04-15 11:49:14,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:14,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897389539] [2022-04-15 11:49:14,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:14,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {97888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {97881#true} is VALID [2022-04-15 11:49:14,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {97881#true} assume true; {97881#true} is VALID [2022-04-15 11:49:14,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97881#true} {97881#true} #705#return; {97881#true} is VALID [2022-04-15 11:49:14,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {97881#true} call ULTIMATE.init(); {97888#(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-15 11:49:14,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {97888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {97881#true} is VALID [2022-04-15 11:49:14,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {97881#true} assume true; {97881#true} is VALID [2022-04-15 11:49:14,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97881#true} {97881#true} #705#return; {97881#true} is VALID [2022-04-15 11:49:14,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {97881#true} call #t~ret161 := main(); {97881#true} is VALID [2022-04-15 11:49:14,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {97881#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {97881#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L272 TraceCheckUtils]: 7: Hoare triple {97881#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {97881#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {97881#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {97881#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {97881#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {97881#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {97881#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {97881#true} assume !false; {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {97881#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {97881#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {97881#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {97881#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {97881#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {97881#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {97881#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {97881#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {97881#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {97881#true} assume 8464 == #t~mem55;havoc #t~mem55; {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {97881#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {97881#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {97881#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {97881#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {97881#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {97881#true} ~skip~0 := 0; {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {97881#true} assume !false; {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {97881#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {97881#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {97881#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {97881#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {97881#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {97881#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {97881#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {97881#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {97881#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {97881#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {97881#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {97881#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {97881#true} assume 8496 == #t~mem58;havoc #t~mem58; {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {97881#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {97881#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {97881#true} is VALID [2022-04-15 11:49:14,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {97881#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {97881#true} is VALID [2022-04-15 11:49:14,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {97881#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,252 INFO L290 TraceCheckUtils]: 69: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:14,252 INFO L290 TraceCheckUtils]: 71: Hoare triple {97886#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {97887#(= |ssl3_accept_#t~mem64| 8656)} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {97887#(= |ssl3_accept_#t~mem64| 8656)} assume 8544 == #t~mem64;havoc #t~mem64; {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {97882#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 74: Hoare triple {97882#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {97882#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {97882#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {97882#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 78: Hoare triple {97882#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 79: Hoare triple {97882#false} assume !(4 == ~blastFlag~0); {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 80: Hoare triple {97882#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 81: Hoare triple {97882#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 82: Hoare triple {97882#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97882#false} is VALID [2022-04-15 11:49:14,253 INFO L290 TraceCheckUtils]: 83: Hoare triple {97882#false} ~skip~0 := 0; {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 84: Hoare triple {97882#false} assume !false; {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 85: Hoare triple {97882#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 86: Hoare triple {97882#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 87: Hoare triple {97882#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 88: Hoare triple {97882#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 89: Hoare triple {97882#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 90: Hoare triple {97882#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 91: Hoare triple {97882#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 92: Hoare triple {97882#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 93: Hoare triple {97882#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 94: Hoare triple {97882#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 95: Hoare triple {97882#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 96: Hoare triple {97882#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,254 INFO L290 TraceCheckUtils]: 97: Hoare triple {97882#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 98: Hoare triple {97882#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 99: Hoare triple {97882#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {97882#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 101: Hoare triple {97882#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 102: Hoare triple {97882#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 103: Hoare triple {97882#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 104: Hoare triple {97882#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 105: Hoare triple {97882#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 106: Hoare triple {97882#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 107: Hoare triple {97882#false} assume 8448 == #t~mem68;havoc #t~mem68; {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 108: Hoare triple {97882#false} assume !(~num1~0 > 0); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 109: Hoare triple {97882#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 110: Hoare triple {97882#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 111: Hoare triple {97882#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97882#false} is VALID [2022-04-15 11:49:14,255 INFO L290 TraceCheckUtils]: 112: Hoare triple {97882#false} ~skip~0 := 0; {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 113: Hoare triple {97882#false} assume !false; {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 114: Hoare triple {97882#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 115: Hoare triple {97882#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 116: Hoare triple {97882#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 117: Hoare triple {97882#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 118: Hoare triple {97882#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 119: Hoare triple {97882#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 120: Hoare triple {97882#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 121: Hoare triple {97882#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 122: Hoare triple {97882#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 123: Hoare triple {97882#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 124: Hoare triple {97882#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 125: Hoare triple {97882#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,256 INFO L290 TraceCheckUtils]: 126: Hoare triple {97882#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 127: Hoare triple {97882#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 128: Hoare triple {97882#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 129: Hoare triple {97882#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 130: Hoare triple {97882#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 131: Hoare triple {97882#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 132: Hoare triple {97882#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 133: Hoare triple {97882#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 134: Hoare triple {97882#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 135: Hoare triple {97882#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 136: Hoare triple {97882#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 137: Hoare triple {97882#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 138: Hoare triple {97882#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 139: Hoare triple {97882#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,257 INFO L290 TraceCheckUtils]: 140: Hoare triple {97882#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,258 INFO L290 TraceCheckUtils]: 141: Hoare triple {97882#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,258 INFO L290 TraceCheckUtils]: 142: Hoare triple {97882#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {97882#false} is VALID [2022-04-15 11:49:14,258 INFO L290 TraceCheckUtils]: 143: Hoare triple {97882#false} assume 8640 == #t~mem75;havoc #t~mem75; {97882#false} is VALID [2022-04-15 11:49:14,258 INFO L290 TraceCheckUtils]: 144: Hoare triple {97882#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {97882#false} is VALID [2022-04-15 11:49:14,258 INFO L290 TraceCheckUtils]: 145: Hoare triple {97882#false} assume !(9 == ~blastFlag~0); {97882#false} is VALID [2022-04-15 11:49:14,258 INFO L290 TraceCheckUtils]: 146: Hoare triple {97882#false} assume !false; {97882#false} is VALID [2022-04-15 11:49:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:49:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897389539] [2022-04-15 11:49:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897389539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:14,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:14,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:14,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [421247342] [2022-04-15 11:49:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [421247342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:14,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494678822] [2022-04-15 11:49:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 11:49:14,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:14,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:14,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:14,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:14,345 INFO L87 Difference]: Start difference. First operand 979 states and 1441 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:22,103 INFO L93 Difference]: Finished difference Result 1995 states and 2939 transitions. [2022-04-15 11:49:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:22,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 11:49:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-15 11:49:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-15 11:49:22,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 528 transitions. [2022-04-15 11:49:22,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:22,515 INFO L225 Difference]: With dead ends: 1995 [2022-04-15 11:49:22,515 INFO L226 Difference]: Without dead ends: 1042 [2022-04-15 11:49:22,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:22,516 INFO L913 BasicCegarLoop]: 204 mSDtfsCounter, 68 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:22,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 527 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:49:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-04-15 11:49:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 979. [2022-04-15 11:49:22,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:22,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1042 states. Second operand has 979 states, 974 states have (on average 1.4733059548254621) internal successors, (1435), 974 states have internal predecessors, (1435), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:22,566 INFO L74 IsIncluded]: Start isIncluded. First operand 1042 states. Second operand has 979 states, 974 states have (on average 1.4733059548254621) internal successors, (1435), 974 states have internal predecessors, (1435), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:22,567 INFO L87 Difference]: Start difference. First operand 1042 states. Second operand has 979 states, 974 states have (on average 1.4733059548254621) internal successors, (1435), 974 states have internal predecessors, (1435), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:22,608 INFO L93 Difference]: Finished difference Result 1042 states and 1526 transitions. [2022-04-15 11:49:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1526 transitions. [2022-04-15 11:49:22,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:22,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:22,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4733059548254621) internal successors, (1435), 974 states have internal predecessors, (1435), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1042 states. [2022-04-15 11:49:22,610 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4733059548254621) internal successors, (1435), 974 states have internal predecessors, (1435), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1042 states. [2022-04-15 11:49:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:22,651 INFO L93 Difference]: Finished difference Result 1042 states and 1526 transitions. [2022-04-15 11:49:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1526 transitions. [2022-04-15 11:49:22,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:22,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:22,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:22,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4733059548254621) internal successors, (1435), 974 states have internal predecessors, (1435), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1439 transitions. [2022-04-15 11:49:22,718 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1439 transitions. Word has length 147 [2022-04-15 11:49:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:22,718 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1439 transitions. [2022-04-15 11:49:22,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:22,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1439 transitions. [2022-04-15 11:49:23,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1439 edges. 1439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1439 transitions. [2022-04-15 11:49:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-15 11:49:23,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:23,870 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:23,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 11:49:23,870 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2101116514, now seen corresponding path program 1 times [2022-04-15 11:49:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:23,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281551027] [2022-04-15 11:49:24,014 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:24,014 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:24,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2101116514, now seen corresponding path program 2 times [2022-04-15 11:49:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:24,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989639104] [2022-04-15 11:49:24,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:24,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:24,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {105932#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {105925#true} is VALID [2022-04-15 11:49:24,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {105925#true} assume true; {105925#true} is VALID [2022-04-15 11:49:24,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105925#true} {105925#true} #705#return; {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {105925#true} call ULTIMATE.init(); {105932#(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-15 11:49:24,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {105932#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {105925#true} assume true; {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105925#true} {105925#true} #705#return; {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {105925#true} call #t~ret161 := main(); {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {105925#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {105925#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L272 TraceCheckUtils]: 7: Hoare triple {105925#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {105925#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {105925#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {105925#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {105925#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105925#true} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {105925#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {105925#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {105925#true} assume !false; {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {105925#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {105925#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {105925#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {105925#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {105925#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {105925#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {105925#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {105925#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {105925#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {105925#true} assume 8464 == #t~mem55;havoc #t~mem55; {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {105925#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105925#true} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {105925#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {105925#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {105925#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {105925#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {105925#true} ~skip~0 := 0; {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {105925#true} assume !false; {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {105925#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {105925#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {105925#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {105925#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {105925#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {105925#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {105925#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {105925#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {105925#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {105925#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {105925#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {105925#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {105925#true} assume 8496 == #t~mem58;havoc #t~mem58; {105925#true} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {105925#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {105925#true} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {105925#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105925#true} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {105925#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {105925#true} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {105925#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 57: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 62: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 63: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,149 INFO L290 TraceCheckUtils]: 71: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:24,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {105930#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {105931#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {105931#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 74: Hoare triple {105926#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 75: Hoare triple {105926#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 76: Hoare triple {105926#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {105926#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {105926#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 79: Hoare triple {105926#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 80: Hoare triple {105926#false} assume !(4 == ~blastFlag~0); {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 81: Hoare triple {105926#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 82: Hoare triple {105926#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 83: Hoare triple {105926#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 84: Hoare triple {105926#false} ~skip~0 := 0; {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 85: Hoare triple {105926#false} assume !false; {105926#false} is VALID [2022-04-15 11:49:24,150 INFO L290 TraceCheckUtils]: 86: Hoare triple {105926#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 87: Hoare triple {105926#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 88: Hoare triple {105926#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 89: Hoare triple {105926#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 90: Hoare triple {105926#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 91: Hoare triple {105926#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 92: Hoare triple {105926#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 93: Hoare triple {105926#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 94: Hoare triple {105926#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 95: Hoare triple {105926#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 96: Hoare triple {105926#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 97: Hoare triple {105926#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 98: Hoare triple {105926#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,151 INFO L290 TraceCheckUtils]: 99: Hoare triple {105926#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 100: Hoare triple {105926#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 101: Hoare triple {105926#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 102: Hoare triple {105926#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 103: Hoare triple {105926#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 104: Hoare triple {105926#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 105: Hoare triple {105926#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 106: Hoare triple {105926#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 107: Hoare triple {105926#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 108: Hoare triple {105926#false} assume 8448 == #t~mem68;havoc #t~mem68; {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 109: Hoare triple {105926#false} assume !(~num1~0 > 0); {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 110: Hoare triple {105926#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {105926#false} is VALID [2022-04-15 11:49:24,152 INFO L290 TraceCheckUtils]: 111: Hoare triple {105926#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 112: Hoare triple {105926#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 113: Hoare triple {105926#false} ~skip~0 := 0; {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 114: Hoare triple {105926#false} assume !false; {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 115: Hoare triple {105926#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 116: Hoare triple {105926#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 117: Hoare triple {105926#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 118: Hoare triple {105926#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 119: Hoare triple {105926#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 120: Hoare triple {105926#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,153 INFO L290 TraceCheckUtils]: 121: Hoare triple {105926#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 122: Hoare triple {105926#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 123: Hoare triple {105926#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 124: Hoare triple {105926#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 125: Hoare triple {105926#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 126: Hoare triple {105926#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 127: Hoare triple {105926#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 128: Hoare triple {105926#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 129: Hoare triple {105926#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 130: Hoare triple {105926#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 131: Hoare triple {105926#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,154 INFO L290 TraceCheckUtils]: 132: Hoare triple {105926#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 133: Hoare triple {105926#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 134: Hoare triple {105926#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 135: Hoare triple {105926#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 136: Hoare triple {105926#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 137: Hoare triple {105926#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 138: Hoare triple {105926#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 139: Hoare triple {105926#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 140: Hoare triple {105926#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 141: Hoare triple {105926#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,155 INFO L290 TraceCheckUtils]: 142: Hoare triple {105926#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,156 INFO L290 TraceCheckUtils]: 143: Hoare triple {105926#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {105926#false} is VALID [2022-04-15 11:49:24,156 INFO L290 TraceCheckUtils]: 144: Hoare triple {105926#false} assume 8640 == #t~mem75;havoc #t~mem75; {105926#false} is VALID [2022-04-15 11:49:24,156 INFO L290 TraceCheckUtils]: 145: Hoare triple {105926#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {105926#false} is VALID [2022-04-15 11:49:24,156 INFO L290 TraceCheckUtils]: 146: Hoare triple {105926#false} assume !(9 == ~blastFlag~0); {105926#false} is VALID [2022-04-15 11:49:24,156 INFO L290 TraceCheckUtils]: 147: Hoare triple {105926#false} assume !false; {105926#false} is VALID [2022-04-15 11:49:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:49:24,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:24,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989639104] [2022-04-15 11:49:24,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989639104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:24,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:24,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:24,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:24,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281551027] [2022-04-15 11:49:24,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281551027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:24,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:24,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:24,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744329636] [2022-04-15 11:49:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:24,158 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 148 [2022-04-15 11:49:24,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:24,158 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-15 11:49:24,238 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-15 11:49:24,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:24,239 INFO L87 Difference]: Start difference. First operand 979 states and 1439 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-15 11:49:26,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:28,670 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-15 11:49:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:31,284 INFO L93 Difference]: Finished difference Result 2065 states and 3032 transitions. [2022-04-15 11:49:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:31,284 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 148 [2022-04-15 11:49:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:31,285 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-15 11:49:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-15 11:49:31,287 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-15 11:49:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-15 11:49:31,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 585 transitions. [2022-04-15 11:49:31,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 585 edges. 585 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:31,709 INFO L225 Difference]: With dead ends: 2065 [2022-04-15 11:49:31,709 INFO L226 Difference]: Without dead ends: 1112 [2022-04-15 11:49:31,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:31,711 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 123 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:31,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 378 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:49:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-04-15 11:49:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 979. [2022-04-15 11:49:31,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:31,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.4589322381930185) internal successors, (1421), 974 states have internal predecessors, (1421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:31,782 INFO L74 IsIncluded]: Start isIncluded. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.4589322381930185) internal successors, (1421), 974 states have internal predecessors, (1421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:31,782 INFO L87 Difference]: Start difference. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.4589322381930185) internal successors, (1421), 974 states have internal predecessors, (1421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:31,829 INFO L93 Difference]: Finished difference Result 1112 states and 1609 transitions. [2022-04-15 11:49:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1609 transitions. [2022-04-15 11:49:31,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:31,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:31,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4589322381930185) internal successors, (1421), 974 states have internal predecessors, (1421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1112 states. [2022-04-15 11:49:31,832 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4589322381930185) internal successors, (1421), 974 states have internal predecessors, (1421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1112 states. [2022-04-15 11:49:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:31,881 INFO L93 Difference]: Finished difference Result 1112 states and 1609 transitions. [2022-04-15 11:49:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1609 transitions. [2022-04-15 11:49:31,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:31,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:31,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:31,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4589322381930185) internal successors, (1421), 974 states have internal predecessors, (1421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1425 transitions. [2022-04-15 11:49:31,948 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1425 transitions. Word has length 148 [2022-04-15 11:49:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:31,948 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1425 transitions. [2022-04-15 11:49:31,949 INFO L479 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-15 11:49:31,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1425 transitions. [2022-04-15 11:49:33,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1425 edges. 1425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1425 transitions. [2022-04-15 11:49:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-15 11:49:33,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:33,256 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:33,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 11:49:33,256 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1898562479, now seen corresponding path program 1 times [2022-04-15 11:49:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:33,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612622168] [2022-04-15 11:49:33,380 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:33,380 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:33,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1898562479, now seen corresponding path program 2 times [2022-04-15 11:49:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:33,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759337618] [2022-04-15 11:49:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:33,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {114256#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {114249#true} is VALID [2022-04-15 11:49:33,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {114249#true} assume true; {114249#true} is VALID [2022-04-15 11:49:33,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114249#true} {114249#true} #705#return; {114249#true} is VALID [2022-04-15 11:49:33,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {114249#true} call ULTIMATE.init(); {114256#(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-15 11:49:33,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {114256#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {114249#true} is VALID [2022-04-15 11:49:33,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {114249#true} assume true; {114249#true} is VALID [2022-04-15 11:49:33,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114249#true} {114249#true} #705#return; {114249#true} is VALID [2022-04-15 11:49:33,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {114249#true} call #t~ret161 := main(); {114249#true} is VALID [2022-04-15 11:49:33,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {114249#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {114249#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L272 TraceCheckUtils]: 7: Hoare triple {114249#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {114249#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {114249#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {114249#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {114249#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {114249#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {114249#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {114249#true} assume !false; {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {114249#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {114249#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {114249#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {114249#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {114249#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {114249#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {114249#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {114249#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {114249#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {114249#true} assume 8464 == #t~mem55;havoc #t~mem55; {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {114249#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {114249#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {114249#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {114249#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {114249#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {114249#true} ~skip~0 := 0; {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {114249#true} assume !false; {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {114249#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {114249#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {114249#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {114249#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {114249#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {114249#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {114249#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {114249#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {114249#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {114249#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {114249#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {114249#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {114249#true} assume 8496 == #t~mem58;havoc #t~mem58; {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {114249#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {114249#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {114249#true} is VALID [2022-04-15 11:49:33,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {114249#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {114249#true} is VALID [2022-04-15 11:49:33,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {114249#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,543 INFO L290 TraceCheckUtils]: 56: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,543 INFO L290 TraceCheckUtils]: 58: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,544 INFO L290 TraceCheckUtils]: 59: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,544 INFO L290 TraceCheckUtils]: 60: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,545 INFO L290 TraceCheckUtils]: 64: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,546 INFO L290 TraceCheckUtils]: 66: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,546 INFO L290 TraceCheckUtils]: 67: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:33,547 INFO L290 TraceCheckUtils]: 69: Hoare triple {114254#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {114255#(= |ssl3_accept_#t~mem62| 8656)} is VALID [2022-04-15 11:49:33,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {114255#(= |ssl3_accept_#t~mem62| 8656)} assume 8528 == #t~mem62;havoc #t~mem62; {114250#false} is VALID [2022-04-15 11:49:33,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {114250#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~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, 232 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,547 INFO L290 TraceCheckUtils]: 72: Hoare triple {114250#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {114250#false} is VALID [2022-04-15 11:49:33,547 INFO L290 TraceCheckUtils]: 73: Hoare triple {114250#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {114250#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 75: Hoare triple {114250#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 76: Hoare triple {114250#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 77: Hoare triple {114250#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 78: Hoare triple {114250#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 79: Hoare triple {114250#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 80: Hoare triple {114250#false} ~skip~0 := 0; {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 81: Hoare triple {114250#false} assume !false; {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 82: Hoare triple {114250#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 83: Hoare triple {114250#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 84: Hoare triple {114250#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 85: Hoare triple {114250#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 86: Hoare triple {114250#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,548 INFO L290 TraceCheckUtils]: 87: Hoare triple {114250#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 88: Hoare triple {114250#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 89: Hoare triple {114250#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 90: Hoare triple {114250#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 91: Hoare triple {114250#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 92: Hoare triple {114250#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 93: Hoare triple {114250#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 94: Hoare triple {114250#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 95: Hoare triple {114250#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 96: Hoare triple {114250#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 97: Hoare triple {114250#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 98: Hoare triple {114250#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 99: Hoare triple {114250#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 100: Hoare triple {114250#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 101: Hoare triple {114250#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,549 INFO L290 TraceCheckUtils]: 102: Hoare triple {114250#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 103: Hoare triple {114250#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 104: Hoare triple {114250#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 105: Hoare triple {114250#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 106: Hoare triple {114250#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 107: Hoare triple {114250#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 108: Hoare triple {114250#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 109: Hoare triple {114250#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 110: Hoare triple {114250#false} assume 8609 == #t~mem74;havoc #t~mem74; {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 111: Hoare triple {114250#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 112: Hoare triple {114250#false} assume !(8 == ~blastFlag~0); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 113: Hoare triple {114250#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 114: Hoare triple {114250#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 115: Hoare triple {114250#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 116: Hoare triple {114250#false} ~skip~0 := 0; {114250#false} is VALID [2022-04-15 11:49:33,550 INFO L290 TraceCheckUtils]: 117: Hoare triple {114250#false} assume !false; {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 118: Hoare triple {114250#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 119: Hoare triple {114250#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 120: Hoare triple {114250#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 121: Hoare triple {114250#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 122: Hoare triple {114250#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 123: Hoare triple {114250#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 124: Hoare triple {114250#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 125: Hoare triple {114250#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 126: Hoare triple {114250#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 127: Hoare triple {114250#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 128: Hoare triple {114250#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 129: Hoare triple {114250#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 130: Hoare triple {114250#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 131: Hoare triple {114250#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,551 INFO L290 TraceCheckUtils]: 132: Hoare triple {114250#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 133: Hoare triple {114250#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 134: Hoare triple {114250#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 135: Hoare triple {114250#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 136: Hoare triple {114250#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 137: Hoare triple {114250#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 138: Hoare triple {114250#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 139: Hoare triple {114250#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 140: Hoare triple {114250#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 141: Hoare triple {114250#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 142: Hoare triple {114250#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 143: Hoare triple {114250#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 144: Hoare triple {114250#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 145: Hoare triple {114250#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 146: Hoare triple {114250#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {114250#false} is VALID [2022-04-15 11:49:33,552 INFO L290 TraceCheckUtils]: 147: Hoare triple {114250#false} assume 8640 == #t~mem75;havoc #t~mem75; {114250#false} is VALID [2022-04-15 11:49:33,553 INFO L290 TraceCheckUtils]: 148: Hoare triple {114250#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {114250#false} is VALID [2022-04-15 11:49:33,553 INFO L290 TraceCheckUtils]: 149: Hoare triple {114250#false} assume !(9 == ~blastFlag~0); {114250#false} is VALID [2022-04-15 11:49:33,553 INFO L290 TraceCheckUtils]: 150: Hoare triple {114250#false} assume !false; {114250#false} is VALID [2022-04-15 11:49:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:49:33,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:33,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759337618] [2022-04-15 11:49:33,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759337618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:33,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:33,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:33,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:33,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612622168] [2022-04-15 11:49:33,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612622168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:33,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:33,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:33,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396837376] [2022-04-15 11:49:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:33,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 11:49:33,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:33,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:33,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:33,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:33,625 INFO L87 Difference]: Start difference. First operand 979 states and 1425 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:35,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:39,385 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-15 11:49:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:40,762 INFO L93 Difference]: Finished difference Result 1979 states and 2881 transitions. [2022-04-15 11:49:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 11:49:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2022-04-15 11:49:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2022-04-15 11:49:40,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 513 transitions. [2022-04-15 11:49:41,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 513 edges. 513 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:41,105 INFO L225 Difference]: With dead ends: 1979 [2022-04-15 11:49:41,105 INFO L226 Difference]: Without dead ends: 1026 [2022-04-15 11:49:41,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:41,106 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 59 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:41,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 545 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 11:49:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2022-04-15 11:49:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 979. [2022-04-15 11:49:41,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:41,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1026 states. Second operand has 979 states, 974 states have (on average 1.4568788501026695) internal successors, (1419), 974 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:41,159 INFO L74 IsIncluded]: Start isIncluded. First operand 1026 states. Second operand has 979 states, 974 states have (on average 1.4568788501026695) internal successors, (1419), 974 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:41,160 INFO L87 Difference]: Start difference. First operand 1026 states. Second operand has 979 states, 974 states have (on average 1.4568788501026695) internal successors, (1419), 974 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:41,199 INFO L93 Difference]: Finished difference Result 1026 states and 1484 transitions. [2022-04-15 11:49:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1484 transitions. [2022-04-15 11:49:41,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:41,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:41,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4568788501026695) internal successors, (1419), 974 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1026 states. [2022-04-15 11:49:41,201 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4568788501026695) internal successors, (1419), 974 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1026 states. [2022-04-15 11:49:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:41,241 INFO L93 Difference]: Finished difference Result 1026 states and 1484 transitions. [2022-04-15 11:49:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1484 transitions. [2022-04-15 11:49:41,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:41,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:41,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:41,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4568788501026695) internal successors, (1419), 974 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1423 transitions. [2022-04-15 11:49:41,306 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1423 transitions. Word has length 151 [2022-04-15 11:49:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:41,307 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1423 transitions. [2022-04-15 11:49:41,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:41,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1423 transitions. [2022-04-15 11:49:42,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1423 edges. 1423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1423 transitions. [2022-04-15 11:49:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-15 11:49:42,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:42,539 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:42,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 11:49:42,540 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:42,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1424092630, now seen corresponding path program 1 times [2022-04-15 11:49:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:42,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [585755463] [2022-04-15 11:49:42,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:42,644 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:42,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1424092630, now seen corresponding path program 2 times [2022-04-15 11:49:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:42,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824384608] [2022-04-15 11:49:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:42,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {122236#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {122229#true} is VALID [2022-04-15 11:49:42,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {122229#true} assume true; {122229#true} is VALID [2022-04-15 11:49:42,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122229#true} {122229#true} #705#return; {122229#true} is VALID [2022-04-15 11:49:42,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {122229#true} call ULTIMATE.init(); {122236#(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-15 11:49:42,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {122236#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {122229#true} is VALID [2022-04-15 11:49:42,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {122229#true} assume true; {122229#true} is VALID [2022-04-15 11:49:42,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122229#true} {122229#true} #705#return; {122229#true} is VALID [2022-04-15 11:49:42,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {122229#true} call #t~ret161 := main(); {122229#true} is VALID [2022-04-15 11:49:42,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {122229#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {122229#true} is VALID [2022-04-15 11:49:42,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {122229#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,760 INFO L272 TraceCheckUtils]: 7: Hoare triple {122229#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {122229#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {122229#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {122229#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {122229#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {122229#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {122229#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {122229#true} assume !false; {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {122229#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {122229#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {122229#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {122229#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {122229#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {122229#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {122229#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {122229#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {122229#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {122229#true} assume 8464 == #t~mem55;havoc #t~mem55; {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {122229#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {122229#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {122229#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {122229#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {122229#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {122229#true} ~skip~0 := 0; {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {122229#true} assume !false; {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {122229#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {122229#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {122229#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {122229#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {122229#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {122229#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {122229#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {122229#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {122229#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {122229#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {122229#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {122229#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {122229#true} assume 8496 == #t~mem58;havoc #t~mem58; {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {122229#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {122229#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {122229#true} is VALID [2022-04-15 11:49:42,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {122229#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {122229#true} is VALID [2022-04-15 11:49:42,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {122229#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:42,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {122234#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {122235#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {122235#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {122230#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~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, 232 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {122230#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {122230#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 75: Hoare triple {122230#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 76: Hoare triple {122230#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {122230#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 78: Hoare triple {122230#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 79: Hoare triple {122230#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 80: Hoare triple {122230#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 81: Hoare triple {122230#false} ~skip~0 := 0; {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 82: Hoare triple {122230#false} assume !false; {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 83: Hoare triple {122230#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,772 INFO L290 TraceCheckUtils]: 84: Hoare triple {122230#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 85: Hoare triple {122230#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 86: Hoare triple {122230#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {122230#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {122230#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 89: Hoare triple {122230#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 90: Hoare triple {122230#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 91: Hoare triple {122230#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 92: Hoare triple {122230#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 93: Hoare triple {122230#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 94: Hoare triple {122230#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 95: Hoare triple {122230#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 96: Hoare triple {122230#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 97: Hoare triple {122230#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,773 INFO L290 TraceCheckUtils]: 98: Hoare triple {122230#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 99: Hoare triple {122230#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 100: Hoare triple {122230#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 101: Hoare triple {122230#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 102: Hoare triple {122230#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 103: Hoare triple {122230#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 104: Hoare triple {122230#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 105: Hoare triple {122230#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 106: Hoare triple {122230#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 107: Hoare triple {122230#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 108: Hoare triple {122230#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 109: Hoare triple {122230#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 110: Hoare triple {122230#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 111: Hoare triple {122230#false} assume 8609 == #t~mem74;havoc #t~mem74; {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 112: Hoare triple {122230#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {122230#false} is VALID [2022-04-15 11:49:42,774 INFO L290 TraceCheckUtils]: 113: Hoare triple {122230#false} assume !(8 == ~blastFlag~0); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 114: Hoare triple {122230#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 115: Hoare triple {122230#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 116: Hoare triple {122230#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 117: Hoare triple {122230#false} ~skip~0 := 0; {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 118: Hoare triple {122230#false} assume !false; {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 119: Hoare triple {122230#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 120: Hoare triple {122230#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 121: Hoare triple {122230#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 122: Hoare triple {122230#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 123: Hoare triple {122230#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 124: Hoare triple {122230#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 125: Hoare triple {122230#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 126: Hoare triple {122230#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,775 INFO L290 TraceCheckUtils]: 127: Hoare triple {122230#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 128: Hoare triple {122230#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 129: Hoare triple {122230#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 130: Hoare triple {122230#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 131: Hoare triple {122230#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 132: Hoare triple {122230#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 133: Hoare triple {122230#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 134: Hoare triple {122230#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 135: Hoare triple {122230#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 136: Hoare triple {122230#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 137: Hoare triple {122230#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 138: Hoare triple {122230#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 139: Hoare triple {122230#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 140: Hoare triple {122230#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,776 INFO L290 TraceCheckUtils]: 141: Hoare triple {122230#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 142: Hoare triple {122230#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 143: Hoare triple {122230#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 144: Hoare triple {122230#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 145: Hoare triple {122230#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 146: Hoare triple {122230#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 147: Hoare triple {122230#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 148: Hoare triple {122230#false} assume 8640 == #t~mem75;havoc #t~mem75; {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 149: Hoare triple {122230#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 150: Hoare triple {122230#false} assume !(9 == ~blastFlag~0); {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L290 TraceCheckUtils]: 151: Hoare triple {122230#false} assume !false; {122230#false} is VALID [2022-04-15 11:49:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:49:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:42,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824384608] [2022-04-15 11:49:42,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824384608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:42,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:42,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:42,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:42,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [585755463] [2022-04-15 11:49:42,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [585755463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:42,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:42,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610053500] [2022-04-15 11:49:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:42,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-15 11:49:42,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:42,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:42,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:42,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:42,858 INFO L87 Difference]: Start difference. First operand 979 states and 1423 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:47,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:51,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:53,532 INFO L93 Difference]: Finished difference Result 2065 states and 3000 transitions. [2022-04-15 11:49:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:53,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-15 11:49:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-15 11:49:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-15 11:49:53,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 584 transitions. [2022-04-15 11:49:53,965 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-15 11:49:54,022 INFO L225 Difference]: With dead ends: 2065 [2022-04-15 11:49:54,022 INFO L226 Difference]: Without dead ends: 1112 [2022-04-15 11:49:54,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:54,024 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 124 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:54,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 378 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-15 11:49:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-04-15 11:49:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 979. [2022-04-15 11:49:54,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:54,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.442505133470226) internal successors, (1405), 974 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,084 INFO L74 IsIncluded]: Start isIncluded. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.442505133470226) internal successors, (1405), 974 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,085 INFO L87 Difference]: Start difference. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.442505133470226) internal successors, (1405), 974 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:54,131 INFO L93 Difference]: Finished difference Result 1112 states and 1593 transitions. [2022-04-15 11:49:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1593 transitions. [2022-04-15 11:49:54,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:54,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:54,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.442505133470226) internal successors, (1405), 974 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1112 states. [2022-04-15 11:49:54,134 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.442505133470226) internal successors, (1405), 974 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1112 states. [2022-04-15 11:49:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:54,180 INFO L93 Difference]: Finished difference Result 1112 states and 1593 transitions. [2022-04-15 11:49:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1593 transitions. [2022-04-15 11:49:54,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:54,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:54,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:54,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.442505133470226) internal successors, (1405), 974 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1409 transitions. [2022-04-15 11:49:54,247 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1409 transitions. Word has length 152 [2022-04-15 11:49:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:54,255 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1409 transitions. [2022-04-15 11:49:54,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1409 transitions. [2022-04-15 11:49:55,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1409 edges. 1409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1409 transitions. [2022-04-15 11:49:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 11:49:55,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:55,736 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:55,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 11:49:55,736 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1561441203, now seen corresponding path program 1 times [2022-04-15 11:49:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:55,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087656789] [2022-04-15 11:49:55,807 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:55,807 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:55,807 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1561441203, now seen corresponding path program 2 times [2022-04-15 11:49:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:55,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405603446] [2022-04-15 11:49:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:55,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:55,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {130560#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {130553#true} is VALID [2022-04-15 11:49:55,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {130553#true} assume true; {130553#true} is VALID [2022-04-15 11:49:55,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130553#true} {130553#true} #705#return; {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {130553#true} call ULTIMATE.init(); {130560#(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-15 11:49:55,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {130560#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {130553#true} assume true; {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130553#true} {130553#true} #705#return; {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {130553#true} call #t~ret161 := main(); {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {130553#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {130553#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L272 TraceCheckUtils]: 7: Hoare triple {130553#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {130553#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {130553#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {130553#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {130553#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130553#true} is VALID [2022-04-15 11:49:55,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {130553#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {130553#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {130553#true} assume !false; {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {130553#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {130553#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {130553#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {130553#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {130553#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {130553#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {130553#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {130553#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {130553#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {130553#true} assume 8464 == #t~mem55;havoc #t~mem55; {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {130553#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {130553#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130553#true} is VALID [2022-04-15 11:49:55,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {130553#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {130553#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {130553#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {130553#true} ~skip~0 := 0; {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {130553#true} assume !false; {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {130553#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {130553#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {130553#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {130553#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {130553#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {130553#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {130553#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {130553#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {130553#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {130553#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {130553#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {130553#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {130553#true} assume 8496 == #t~mem58;havoc #t~mem58; {130553#true} is VALID [2022-04-15 11:49:55,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {130553#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {130553#true} is VALID [2022-04-15 11:49:55,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {130553#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130553#true} is VALID [2022-04-15 11:49:55,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {130553#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {130553#true} is VALID [2022-04-15 11:49:55,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {130553#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,913 INFO L290 TraceCheckUtils]: 54: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,913 INFO L290 TraceCheckUtils]: 55: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,913 INFO L290 TraceCheckUtils]: 56: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,914 INFO L290 TraceCheckUtils]: 59: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,916 INFO L290 TraceCheckUtils]: 64: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,916 INFO L290 TraceCheckUtils]: 65: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,917 INFO L290 TraceCheckUtils]: 66: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,917 INFO L290 TraceCheckUtils]: 67: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,917 INFO L290 TraceCheckUtils]: 68: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,918 INFO L290 TraceCheckUtils]: 70: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,918 INFO L290 TraceCheckUtils]: 71: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:55,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {130558#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {130559#(= |ssl3_accept_#t~mem69| 8656)} is VALID [2022-04-15 11:49:55,920 INFO L290 TraceCheckUtils]: 77: Hoare triple {130559#(= |ssl3_accept_#t~mem69| 8656)} assume 8576 == #t~mem69;havoc #t~mem69; {130554#false} is VALID [2022-04-15 11:49:55,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {130554#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {130554#false} is VALID [2022-04-15 11:49:55,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {130554#false} assume !(5 == ~blastFlag~0); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 80: Hoare triple {130554#false} assume !(~ret~0 <= 0); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {130554#false} assume 2 == ~ret~0;call write~int(8466, ~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {130554#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 83: Hoare triple {130554#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 84: Hoare triple {130554#false} ~skip~0 := 0; {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 85: Hoare triple {130554#false} assume !false; {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 86: Hoare triple {130554#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 87: Hoare triple {130554#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 88: Hoare triple {130554#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 89: Hoare triple {130554#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 90: Hoare triple {130554#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 91: Hoare triple {130554#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 92: Hoare triple {130554#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,921 INFO L290 TraceCheckUtils]: 93: Hoare triple {130554#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 94: Hoare triple {130554#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 95: Hoare triple {130554#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 96: Hoare triple {130554#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 97: Hoare triple {130554#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 98: Hoare triple {130554#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 99: Hoare triple {130554#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 100: Hoare triple {130554#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 101: Hoare triple {130554#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 102: Hoare triple {130554#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 103: Hoare triple {130554#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 104: Hoare triple {130554#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 105: Hoare triple {130554#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 106: Hoare triple {130554#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,922 INFO L290 TraceCheckUtils]: 107: Hoare triple {130554#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 108: Hoare triple {130554#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 109: Hoare triple {130554#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 110: Hoare triple {130554#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 111: Hoare triple {130554#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 112: Hoare triple {130554#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 113: Hoare triple {130554#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 114: Hoare triple {130554#false} assume 8609 == #t~mem74;havoc #t~mem74; {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 115: Hoare triple {130554#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 116: Hoare triple {130554#false} assume !(8 == ~blastFlag~0); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 117: Hoare triple {130554#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 118: Hoare triple {130554#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 119: Hoare triple {130554#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 120: Hoare triple {130554#false} ~skip~0 := 0; {130554#false} is VALID [2022-04-15 11:49:55,923 INFO L290 TraceCheckUtils]: 121: Hoare triple {130554#false} assume !false; {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 122: Hoare triple {130554#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 123: Hoare triple {130554#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 124: Hoare triple {130554#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 125: Hoare triple {130554#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 126: Hoare triple {130554#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 127: Hoare triple {130554#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 128: Hoare triple {130554#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 129: Hoare triple {130554#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 130: Hoare triple {130554#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 131: Hoare triple {130554#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 132: Hoare triple {130554#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 133: Hoare triple {130554#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 134: Hoare triple {130554#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,924 INFO L290 TraceCheckUtils]: 135: Hoare triple {130554#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 136: Hoare triple {130554#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 137: Hoare triple {130554#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 138: Hoare triple {130554#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 139: Hoare triple {130554#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 140: Hoare triple {130554#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 141: Hoare triple {130554#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 142: Hoare triple {130554#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 143: Hoare triple {130554#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 144: Hoare triple {130554#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 145: Hoare triple {130554#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 146: Hoare triple {130554#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 147: Hoare triple {130554#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 148: Hoare triple {130554#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 149: Hoare triple {130554#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,925 INFO L290 TraceCheckUtils]: 150: Hoare triple {130554#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {130554#false} is VALID [2022-04-15 11:49:55,926 INFO L290 TraceCheckUtils]: 151: Hoare triple {130554#false} assume 8640 == #t~mem75;havoc #t~mem75; {130554#false} is VALID [2022-04-15 11:49:55,926 INFO L290 TraceCheckUtils]: 152: Hoare triple {130554#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {130554#false} is VALID [2022-04-15 11:49:55,926 INFO L290 TraceCheckUtils]: 153: Hoare triple {130554#false} assume !(9 == ~blastFlag~0); {130554#false} is VALID [2022-04-15 11:49:55,926 INFO L290 TraceCheckUtils]: 154: Hoare triple {130554#false} assume !false; {130554#false} is VALID [2022-04-15 11:49:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:49:55,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:55,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405603446] [2022-04-15 11:49:55,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405603446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:55,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:55,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:55,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:55,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087656789] [2022-04-15 11:49:55,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087656789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:55,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:55,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360875582] [2022-04-15 11:49:55,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:55,928 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 155 [2022-04-15 11:49:55,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:55,928 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-15 11:49:56,003 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-15 11:49:56,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:56,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:56,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:56,004 INFO L87 Difference]: Start difference. First operand 979 states and 1409 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-15 11:49:59,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:06,462 INFO L93 Difference]: Finished difference Result 1975 states and 2843 transitions. [2022-04-15 11:50:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:06,463 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 155 [2022-04-15 11:50:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:06,463 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-15 11:50:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-04-15 11:50:06,465 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-15 11:50:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-04-15 11:50:06,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 508 transitions. [2022-04-15 11:50:06,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:06,819 INFO L225 Difference]: With dead ends: 1975 [2022-04-15 11:50:06,820 INFO L226 Difference]: Without dead ends: 1022 [2022-04-15 11:50:06,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:06,821 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 49 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:06,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 551 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 11:50:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-04-15 11:50:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 979. [2022-04-15 11:50:06,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:06,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1022 states. Second operand has 979 states, 974 states have (on average 1.4404517453798769) internal successors, (1403), 974 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:06,899 INFO L74 IsIncluded]: Start isIncluded. First operand 1022 states. Second operand has 979 states, 974 states have (on average 1.4404517453798769) internal successors, (1403), 974 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:06,899 INFO L87 Difference]: Start difference. First operand 1022 states. Second operand has 979 states, 974 states have (on average 1.4404517453798769) internal successors, (1403), 974 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:06,930 INFO L93 Difference]: Finished difference Result 1022 states and 1462 transitions. [2022-04-15 11:50:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1462 transitions. [2022-04-15 11:50:06,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:06,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:06,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4404517453798769) internal successors, (1403), 974 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1022 states. [2022-04-15 11:50:06,932 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4404517453798769) internal successors, (1403), 974 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1022 states. [2022-04-15 11:50:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:06,963 INFO L93 Difference]: Finished difference Result 1022 states and 1462 transitions. [2022-04-15 11:50:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1462 transitions. [2022-04-15 11:50:06,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:06,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:06,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:06,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4404517453798769) internal successors, (1403), 974 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1407 transitions. [2022-04-15 11:50:07,007 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1407 transitions. Word has length 155 [2022-04-15 11:50:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:07,007 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1407 transitions. [2022-04-15 11:50:07,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:07,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1407 transitions. [2022-04-15 11:50:08,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1407 edges. 1407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1407 transitions. [2022-04-15 11:50:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 11:50:08,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:08,159 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:08,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 11:50:08,160 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:08,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:08,160 INFO L85 PathProgramCache]: Analyzing trace with hash 82591744, now seen corresponding path program 1 times [2022-04-15 11:50:08,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:08,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1787212816] [2022-04-15 11:50:08,240 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:08,240 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:08,240 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 82591744, now seen corresponding path program 2 times [2022-04-15 11:50:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:08,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626422246] [2022-04-15 11:50:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:08,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:08,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {138524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {138517#true} is VALID [2022-04-15 11:50:08,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {138517#true} assume true; {138517#true} is VALID [2022-04-15 11:50:08,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138517#true} {138517#true} #705#return; {138517#true} is VALID [2022-04-15 11:50:08,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {138517#true} call ULTIMATE.init(); {138524#(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-15 11:50:08,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {138524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {138517#true} is VALID [2022-04-15 11:50:08,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {138517#true} assume true; {138517#true} is VALID [2022-04-15 11:50:08,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138517#true} {138517#true} #705#return; {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {138517#true} call #t~ret161 := main(); {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {138517#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {138517#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L272 TraceCheckUtils]: 7: Hoare triple {138517#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {138517#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {138517#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {138517#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {138517#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {138517#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {138517#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {138517#true} assume !false; {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {138517#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {138517#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {138517#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {138517#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {138517#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {138517#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {138517#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {138517#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {138517#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {138517#true} assume 8464 == #t~mem55;havoc #t~mem55; {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {138517#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {138517#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {138517#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {138517#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {138517#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {138517#true} ~skip~0 := 0; {138517#true} is VALID [2022-04-15 11:50:08,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {138517#true} assume !false; {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {138517#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {138517#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {138517#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {138517#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {138517#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {138517#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {138517#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {138517#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {138517#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {138517#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {138517#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {138517#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {138517#true} assume 8496 == #t~mem58;havoc #t~mem58; {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {138517#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {138517#true} is VALID [2022-04-15 11:50:08,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {138517#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {138517#true} is VALID [2022-04-15 11:50:08,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {138517#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {138517#true} is VALID [2022-04-15 11:50:08,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {138517#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,406 INFO L290 TraceCheckUtils]: 49: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,406 INFO L290 TraceCheckUtils]: 50: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,406 INFO L290 TraceCheckUtils]: 51: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,411 INFO L290 TraceCheckUtils]: 64: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,412 INFO L290 TraceCheckUtils]: 67: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,413 INFO L290 TraceCheckUtils]: 72: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,414 INFO L290 TraceCheckUtils]: 73: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,414 INFO L290 TraceCheckUtils]: 74: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,414 INFO L290 TraceCheckUtils]: 75: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:08,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {138522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {138523#(= |ssl3_accept_#t~mem71| 8656)} is VALID [2022-04-15 11:50:08,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {138523#(= |ssl3_accept_#t~mem71| 8656)} assume 8592 == #t~mem71;havoc #t~mem71; {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {138518#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 81: Hoare triple {138518#false} assume !(7 == ~blastFlag~0); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 82: Hoare triple {138518#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 83: Hoare triple {138518#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {138518#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {138518#false} ~skip~0 := 0; {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {138518#false} assume !false; {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 87: Hoare triple {138518#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {138518#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {138518#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {138518#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {138518#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 92: Hoare triple {138518#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {138518#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 94: Hoare triple {138518#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {138518#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 96: Hoare triple {138518#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 97: Hoare triple {138518#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 98: Hoare triple {138518#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 99: Hoare triple {138518#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 100: Hoare triple {138518#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 101: Hoare triple {138518#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 102: Hoare triple {138518#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 103: Hoare triple {138518#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 104: Hoare triple {138518#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 105: Hoare triple {138518#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 106: Hoare triple {138518#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 107: Hoare triple {138518#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,417 INFO L290 TraceCheckUtils]: 108: Hoare triple {138518#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 109: Hoare triple {138518#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 110: Hoare triple {138518#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 111: Hoare triple {138518#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 112: Hoare triple {138518#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 113: Hoare triple {138518#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 114: Hoare triple {138518#false} assume 8608 == #t~mem73;havoc #t~mem73; {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 115: Hoare triple {138518#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 116: Hoare triple {138518#false} assume !(8 == ~blastFlag~0); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 117: Hoare triple {138518#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 118: Hoare triple {138518#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 119: Hoare triple {138518#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 120: Hoare triple {138518#false} ~skip~0 := 0; {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 121: Hoare triple {138518#false} assume !false; {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 122: Hoare triple {138518#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,418 INFO L290 TraceCheckUtils]: 123: Hoare triple {138518#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 124: Hoare triple {138518#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 125: Hoare triple {138518#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 126: Hoare triple {138518#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 127: Hoare triple {138518#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 128: Hoare triple {138518#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 129: Hoare triple {138518#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 130: Hoare triple {138518#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 131: Hoare triple {138518#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 132: Hoare triple {138518#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 133: Hoare triple {138518#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 134: Hoare triple {138518#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 135: Hoare triple {138518#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 136: Hoare triple {138518#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 137: Hoare triple {138518#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,419 INFO L290 TraceCheckUtils]: 138: Hoare triple {138518#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 139: Hoare triple {138518#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 140: Hoare triple {138518#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 141: Hoare triple {138518#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 142: Hoare triple {138518#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 143: Hoare triple {138518#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 144: Hoare triple {138518#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 145: Hoare triple {138518#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 146: Hoare triple {138518#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 147: Hoare triple {138518#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 148: Hoare triple {138518#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 149: Hoare triple {138518#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 150: Hoare triple {138518#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 151: Hoare triple {138518#false} assume 8640 == #t~mem75;havoc #t~mem75; {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 152: Hoare triple {138518#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {138518#false} is VALID [2022-04-15 11:50:08,420 INFO L290 TraceCheckUtils]: 153: Hoare triple {138518#false} assume !(9 == ~blastFlag~0); {138518#false} is VALID [2022-04-15 11:50:08,421 INFO L290 TraceCheckUtils]: 154: Hoare triple {138518#false} assume !false; {138518#false} is VALID [2022-04-15 11:50:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 11:50:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:08,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626422246] [2022-04-15 11:50:08,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626422246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:08,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:08,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:08,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1787212816] [2022-04-15 11:50:08,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1787212816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:08,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:08,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510802478] [2022-04-15 11:50:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-15 11:50:08,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:08,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:08,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:08,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:08,501 INFO L87 Difference]: Start difference. First operand 979 states and 1407 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:10,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:11,848 INFO L93 Difference]: Finished difference Result 1975 states and 2839 transitions. [2022-04-15 11:50:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-15 11:50:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2022-04-15 11:50:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2022-04-15 11:50:11,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 507 transitions. [2022-04-15 11:50:12,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:12,204 INFO L225 Difference]: With dead ends: 1975 [2022-04-15 11:50:12,205 INFO L226 Difference]: Without dead ends: 1022 [2022-04-15 11:50:12,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:12,206 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 46 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:12,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 551 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 463 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:50:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-04-15 11:50:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 979. [2022-04-15 11:50:12,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:12,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1022 states. Second operand has 979 states, 974 states have (on average 1.4383983572895278) internal successors, (1401), 974 states have internal predecessors, (1401), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,267 INFO L74 IsIncluded]: Start isIncluded. First operand 1022 states. Second operand has 979 states, 974 states have (on average 1.4383983572895278) internal successors, (1401), 974 states have internal predecessors, (1401), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,268 INFO L87 Difference]: Start difference. First operand 1022 states. Second operand has 979 states, 974 states have (on average 1.4383983572895278) internal successors, (1401), 974 states have internal predecessors, (1401), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:12,297 INFO L93 Difference]: Finished difference Result 1022 states and 1460 transitions. [2022-04-15 11:50:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1460 transitions. [2022-04-15 11:50:12,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:12,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:12,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4383983572895278) internal successors, (1401), 974 states have internal predecessors, (1401), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1022 states. [2022-04-15 11:50:12,300 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4383983572895278) internal successors, (1401), 974 states have internal predecessors, (1401), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1022 states. [2022-04-15 11:50:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:12,330 INFO L93 Difference]: Finished difference Result 1022 states and 1460 transitions. [2022-04-15 11:50:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1460 transitions. [2022-04-15 11:50:12,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:12,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:12,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:12,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4383983572895278) internal successors, (1401), 974 states have internal predecessors, (1401), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1405 transitions. [2022-04-15 11:50:12,382 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1405 transitions. Word has length 155 [2022-04-15 11:50:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:12,382 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1405 transitions. [2022-04-15 11:50:12,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1405 transitions. [2022-04-15 11:50:13,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1405 edges. 1405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1405 transitions. [2022-04-15 11:50:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-15 11:50:13,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:13,746 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:13,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 11:50:13,747 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1289040121, now seen corresponding path program 1 times [2022-04-15 11:50:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797173889] [2022-04-15 11:50:13,842 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:13,842 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:13,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1289040121, now seen corresponding path program 2 times [2022-04-15 11:50:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:13,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348626632] [2022-04-15 11:50:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:13,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:13,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {146488#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {146481#true} is VALID [2022-04-15 11:50:13,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {146481#true} assume true; {146481#true} is VALID [2022-04-15 11:50:13,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146481#true} {146481#true} #705#return; {146481#true} is VALID [2022-04-15 11:50:13,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {146481#true} call ULTIMATE.init(); {146488#(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-15 11:50:13,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {146488#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {146481#true} is VALID [2022-04-15 11:50:13,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {146481#true} assume true; {146481#true} is VALID [2022-04-15 11:50:13,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146481#true} {146481#true} #705#return; {146481#true} is VALID [2022-04-15 11:50:13,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {146481#true} call #t~ret161 := main(); {146481#true} is VALID [2022-04-15 11:50:13,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {146481#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {146481#true} is VALID [2022-04-15 11:50:13,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {146481#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L272 TraceCheckUtils]: 7: Hoare triple {146481#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {146481#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {146481#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {146481#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {146481#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {146481#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {146481#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {146481#true} assume !false; {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {146481#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {146481#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {146481#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {146481#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {146481#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {146481#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {146481#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {146481#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {146481#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {146481#true} assume 8464 == #t~mem55;havoc #t~mem55; {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {146481#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {146481#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {146481#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {146481#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {146481#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {146481#true} ~skip~0 := 0; {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {146481#true} assume !false; {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {146481#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {146481#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {146481#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {146481#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {146481#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {146481#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {146481#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {146481#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {146481#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {146481#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {146481#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {146481#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {146481#true} assume 8496 == #t~mem58;havoc #t~mem58; {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {146481#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {146481#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {146481#true} is VALID [2022-04-15 11:50:13,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {146481#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {146481#true} is VALID [2022-04-15 11:50:13,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {146481#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,964 INFO L290 TraceCheckUtils]: 55: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,966 INFO L290 TraceCheckUtils]: 63: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,967 INFO L290 TraceCheckUtils]: 64: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,970 INFO L290 TraceCheckUtils]: 73: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,970 INFO L290 TraceCheckUtils]: 74: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,970 INFO L290 TraceCheckUtils]: 75: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,971 INFO L290 TraceCheckUtils]: 76: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:13,971 INFO L290 TraceCheckUtils]: 77: Hoare triple {146486#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {146487#(not (= |ssl3_accept_#t~mem70| 8577))} is VALID [2022-04-15 11:50:13,971 INFO L290 TraceCheckUtils]: 78: Hoare triple {146487#(not (= |ssl3_accept_#t~mem70| 8577))} assume 8577 == #t~mem70;havoc #t~mem70; {146482#false} is VALID [2022-04-15 11:50:13,971 INFO L290 TraceCheckUtils]: 79: Hoare triple {146482#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {146482#false} is VALID [2022-04-15 11:50:13,971 INFO L290 TraceCheckUtils]: 80: Hoare triple {146482#false} assume !(5 == ~blastFlag~0); {146482#false} is VALID [2022-04-15 11:50:13,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {146482#false} assume !(~ret~0 <= 0); {146482#false} is VALID [2022-04-15 11:50:13,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {146482#false} assume 2 == ~ret~0;call write~int(8466, ~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 83: Hoare triple {146482#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 84: Hoare triple {146482#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 85: Hoare triple {146482#false} ~skip~0 := 0; {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 86: Hoare triple {146482#false} assume !false; {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 87: Hoare triple {146482#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 88: Hoare triple {146482#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 89: Hoare triple {146482#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 90: Hoare triple {146482#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 91: Hoare triple {146482#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 92: Hoare triple {146482#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 93: Hoare triple {146482#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 94: Hoare triple {146482#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 95: Hoare triple {146482#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 96: Hoare triple {146482#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,972 INFO L290 TraceCheckUtils]: 97: Hoare triple {146482#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 98: Hoare triple {146482#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 99: Hoare triple {146482#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 100: Hoare triple {146482#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 101: Hoare triple {146482#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 102: Hoare triple {146482#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 103: Hoare triple {146482#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 104: Hoare triple {146482#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 105: Hoare triple {146482#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 106: Hoare triple {146482#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 107: Hoare triple {146482#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 108: Hoare triple {146482#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 109: Hoare triple {146482#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 110: Hoare triple {146482#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,973 INFO L290 TraceCheckUtils]: 111: Hoare triple {146482#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 112: Hoare triple {146482#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 113: Hoare triple {146482#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 114: Hoare triple {146482#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 115: Hoare triple {146482#false} assume 8609 == #t~mem74;havoc #t~mem74; {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 116: Hoare triple {146482#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 117: Hoare triple {146482#false} assume !(8 == ~blastFlag~0); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 118: Hoare triple {146482#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 119: Hoare triple {146482#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 120: Hoare triple {146482#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 121: Hoare triple {146482#false} ~skip~0 := 0; {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 122: Hoare triple {146482#false} assume !false; {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 123: Hoare triple {146482#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 124: Hoare triple {146482#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 125: Hoare triple {146482#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,974 INFO L290 TraceCheckUtils]: 126: Hoare triple {146482#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 127: Hoare triple {146482#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 128: Hoare triple {146482#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 129: Hoare triple {146482#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 130: Hoare triple {146482#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 131: Hoare triple {146482#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 132: Hoare triple {146482#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 133: Hoare triple {146482#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 134: Hoare triple {146482#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 135: Hoare triple {146482#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 136: Hoare triple {146482#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 137: Hoare triple {146482#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 138: Hoare triple {146482#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 139: Hoare triple {146482#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 140: Hoare triple {146482#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,975 INFO L290 TraceCheckUtils]: 141: Hoare triple {146482#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 142: Hoare triple {146482#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 143: Hoare triple {146482#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 144: Hoare triple {146482#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 145: Hoare triple {146482#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 146: Hoare triple {146482#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 147: Hoare triple {146482#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 148: Hoare triple {146482#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 149: Hoare triple {146482#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 150: Hoare triple {146482#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 151: Hoare triple {146482#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 152: Hoare triple {146482#false} assume 8640 == #t~mem75;havoc #t~mem75; {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 153: Hoare triple {146482#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 154: Hoare triple {146482#false} assume !(9 == ~blastFlag~0); {146482#false} is VALID [2022-04-15 11:50:13,976 INFO L290 TraceCheckUtils]: 155: Hoare triple {146482#false} assume !false; {146482#false} is VALID [2022-04-15 11:50:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:50:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348626632] [2022-04-15 11:50:13,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348626632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:13,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:13,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:13,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797173889] [2022-04-15 11:50:13,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797173889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:13,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:13,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576891365] [2022-04-15 11:50:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:13,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-15 11:50:13,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:13,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:14,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:14,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:14,072 INFO L87 Difference]: Start difference. First operand 979 states and 1405 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:18,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:22,695 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-15 11:50:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:24,091 INFO L93 Difference]: Finished difference Result 2065 states and 2964 transitions. [2022-04-15 11:50:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-15 11:50:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-15 11:50:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-15 11:50:24,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-15 11:50:24,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:24,541 INFO L225 Difference]: With dead ends: 2065 [2022-04-15 11:50:24,541 INFO L226 Difference]: Without dead ends: 1112 [2022-04-15 11:50:24,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:24,543 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 116 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:24,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 378 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 11:50:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-04-15 11:50:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 979. [2022-04-15 11:50:24,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:24,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.4301848049281314) internal successors, (1393), 974 states have internal predecessors, (1393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,603 INFO L74 IsIncluded]: Start isIncluded. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.4301848049281314) internal successors, (1393), 974 states have internal predecessors, (1393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,604 INFO L87 Difference]: Start difference. First operand 1112 states. Second operand has 979 states, 974 states have (on average 1.4301848049281314) internal successors, (1393), 974 states have internal predecessors, (1393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:24,639 INFO L93 Difference]: Finished difference Result 1112 states and 1581 transitions. [2022-04-15 11:50:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1581 transitions. [2022-04-15 11:50:24,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:24,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:24,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4301848049281314) internal successors, (1393), 974 states have internal predecessors, (1393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1112 states. [2022-04-15 11:50:24,641 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4301848049281314) internal successors, (1393), 974 states have internal predecessors, (1393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1112 states. [2022-04-15 11:50:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:24,676 INFO L93 Difference]: Finished difference Result 1112 states and 1581 transitions. [2022-04-15 11:50:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1581 transitions. [2022-04-15 11:50:24,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:24,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:24,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:24,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4301848049281314) internal successors, (1393), 974 states have internal predecessors, (1393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1397 transitions. [2022-04-15 11:50:24,719 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1397 transitions. Word has length 156 [2022-04-15 11:50:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:24,719 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1397 transitions. [2022-04-15 11:50:24,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1397 transitions. [2022-04-15 11:50:26,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1397 edges. 1397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1397 transitions. [2022-04-15 11:50:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-15 11:50:26,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:26,139 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:26,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 11:50:26,139 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:26,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1451116876, now seen corresponding path program 1 times [2022-04-15 11:50:26,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:26,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [606103169] [2022-04-15 11:50:26,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:26,235 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:26,235 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:26,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1451116876, now seen corresponding path program 2 times [2022-04-15 11:50:26,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:26,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098799759] [2022-04-15 11:50:26,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:26,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:26,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {154812#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {154805#true} is VALID [2022-04-15 11:50:26,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {154805#true} assume true; {154805#true} is VALID [2022-04-15 11:50:26,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154805#true} {154805#true} #705#return; {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {154805#true} call ULTIMATE.init(); {154812#(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-15 11:50:26,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {154812#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {154805#true} assume true; {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154805#true} {154805#true} #705#return; {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {154805#true} call #t~ret161 := main(); {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {154805#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {154805#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L272 TraceCheckUtils]: 7: Hoare triple {154805#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {154805#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {154805#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {154805#true} is VALID [2022-04-15 11:50:26,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {154805#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {154805#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {154805#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {154805#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {154805#true} assume !false; {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {154805#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {154805#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {154805#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {154805#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {154805#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {154805#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {154805#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {154805#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {154805#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {154805#true} assume 8464 == #t~mem55;havoc #t~mem55; {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {154805#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {154805#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {154805#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {154805#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {154805#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {154805#true} ~skip~0 := 0; {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {154805#true} assume !false; {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {154805#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {154805#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {154805#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {154805#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {154805#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {154805#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {154805#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {154805#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {154805#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {154805#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {154805#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {154805#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {154805#true} assume 8496 == #t~mem58;havoc #t~mem58; {154805#true} is VALID [2022-04-15 11:50:26,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {154805#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {154805#true} is VALID [2022-04-15 11:50:26,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {154805#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {154805#true} is VALID [2022-04-15 11:50:26,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {154805#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {154805#true} is VALID [2022-04-15 11:50:26,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {154805#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,351 INFO L290 TraceCheckUtils]: 50: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,351 INFO L290 TraceCheckUtils]: 51: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,354 INFO L290 TraceCheckUtils]: 62: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,356 INFO L290 TraceCheckUtils]: 67: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,356 INFO L290 TraceCheckUtils]: 68: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,357 INFO L290 TraceCheckUtils]: 71: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,358 INFO L290 TraceCheckUtils]: 72: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,358 INFO L290 TraceCheckUtils]: 73: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,358 INFO L290 TraceCheckUtils]: 75: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,359 INFO L290 TraceCheckUtils]: 78: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {154810#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {154811#(= |ssl3_accept_#t~mem72| 8656)} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 80: Hoare triple {154811#(= |ssl3_accept_#t~mem72| 8656)} assume 8593 == #t~mem72;havoc #t~mem72; {154806#false} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 81: Hoare triple {154806#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {154806#false} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 82: Hoare triple {154806#false} assume !(7 == ~blastFlag~0); {154806#false} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {154806#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {154806#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {154806#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {154806#false} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {154806#false} ~skip~0 := 0; {154806#false} is VALID [2022-04-15 11:50:26,360 INFO L290 TraceCheckUtils]: 87: Hoare triple {154806#false} assume !false; {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 88: Hoare triple {154806#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {154806#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 90: Hoare triple {154806#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 91: Hoare triple {154806#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 92: Hoare triple {154806#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 93: Hoare triple {154806#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 94: Hoare triple {154806#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 95: Hoare triple {154806#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 96: Hoare triple {154806#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 97: Hoare triple {154806#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 98: Hoare triple {154806#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 99: Hoare triple {154806#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 100: Hoare triple {154806#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 101: Hoare triple {154806#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,361 INFO L290 TraceCheckUtils]: 102: Hoare triple {154806#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 103: Hoare triple {154806#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 104: Hoare triple {154806#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 105: Hoare triple {154806#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 106: Hoare triple {154806#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 107: Hoare triple {154806#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 108: Hoare triple {154806#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 109: Hoare triple {154806#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 110: Hoare triple {154806#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 111: Hoare triple {154806#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 112: Hoare triple {154806#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 113: Hoare triple {154806#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 114: Hoare triple {154806#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 115: Hoare triple {154806#false} assume 8608 == #t~mem73;havoc #t~mem73; {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 116: Hoare triple {154806#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {154806#false} is VALID [2022-04-15 11:50:26,362 INFO L290 TraceCheckUtils]: 117: Hoare triple {154806#false} assume !(8 == ~blastFlag~0); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 118: Hoare triple {154806#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 119: Hoare triple {154806#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 120: Hoare triple {154806#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 121: Hoare triple {154806#false} ~skip~0 := 0; {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 122: Hoare triple {154806#false} assume !false; {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 123: Hoare triple {154806#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 124: Hoare triple {154806#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 125: Hoare triple {154806#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 126: Hoare triple {154806#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 127: Hoare triple {154806#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 128: Hoare triple {154806#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 129: Hoare triple {154806#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 130: Hoare triple {154806#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,363 INFO L290 TraceCheckUtils]: 131: Hoare triple {154806#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 132: Hoare triple {154806#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 133: Hoare triple {154806#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 134: Hoare triple {154806#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 135: Hoare triple {154806#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 136: Hoare triple {154806#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 137: Hoare triple {154806#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 138: Hoare triple {154806#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 139: Hoare triple {154806#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 140: Hoare triple {154806#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 141: Hoare triple {154806#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 142: Hoare triple {154806#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 143: Hoare triple {154806#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 144: Hoare triple {154806#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 145: Hoare triple {154806#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,364 INFO L290 TraceCheckUtils]: 146: Hoare triple {154806#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 147: Hoare triple {154806#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 148: Hoare triple {154806#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 149: Hoare triple {154806#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 150: Hoare triple {154806#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 151: Hoare triple {154806#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 152: Hoare triple {154806#false} assume 8640 == #t~mem75;havoc #t~mem75; {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 153: Hoare triple {154806#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 154: Hoare triple {154806#false} assume !(9 == ~blastFlag~0); {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L290 TraceCheckUtils]: 155: Hoare triple {154806#false} assume !false; {154806#false} is VALID [2022-04-15 11:50:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 11:50:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098799759] [2022-04-15 11:50:26,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098799759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:26,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:26,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:26,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [606103169] [2022-04-15 11:50:26,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [606103169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:26,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:26,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126783613] [2022-04-15 11:50:26,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-15 11:50:26,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:26,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:26,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:26,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:26,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:26,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:26,434 INFO L87 Difference]: Start difference. First operand 979 states and 1397 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:34,377 INFO L93 Difference]: Finished difference Result 1957 states and 2796 transitions. [2022-04-15 11:50:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:34,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2022-04-15 11:50:34,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2022-04-15 11:50:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2022-04-15 11:50:34,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 492 transitions. [2022-04-15 11:50:34,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:34,724 INFO L225 Difference]: With dead ends: 1957 [2022-04-15 11:50:34,725 INFO L226 Difference]: Without dead ends: 1004 [2022-04-15 11:50:34,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:34,727 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 33 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:34,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 557 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:50:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-04-15 11:50:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 979. [2022-04-15 11:50:34,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:34,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1004 states. Second operand has 979 states, 974 states have (on average 1.4281314168377823) internal successors, (1391), 974 states have internal predecessors, (1391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:34,787 INFO L74 IsIncluded]: Start isIncluded. First operand 1004 states. Second operand has 979 states, 974 states have (on average 1.4281314168377823) internal successors, (1391), 974 states have internal predecessors, (1391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:34,788 INFO L87 Difference]: Start difference. First operand 1004 states. Second operand has 979 states, 974 states have (on average 1.4281314168377823) internal successors, (1391), 974 states have internal predecessors, (1391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:34,817 INFO L93 Difference]: Finished difference Result 1004 states and 1427 transitions. [2022-04-15 11:50:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1427 transitions. [2022-04-15 11:50:34,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:34,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:34,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 979 states, 974 states have (on average 1.4281314168377823) internal successors, (1391), 974 states have internal predecessors, (1391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1004 states. [2022-04-15 11:50:34,820 INFO L87 Difference]: Start difference. First operand has 979 states, 974 states have (on average 1.4281314168377823) internal successors, (1391), 974 states have internal predecessors, (1391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1004 states. [2022-04-15 11:50:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:34,849 INFO L93 Difference]: Finished difference Result 1004 states and 1427 transitions. [2022-04-15 11:50:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1427 transitions. [2022-04-15 11:50:34,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:34,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:34,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:34,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 974 states have (on average 1.4281314168377823) internal successors, (1391), 974 states have internal predecessors, (1391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1395 transitions. [2022-04-15 11:50:34,901 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1395 transitions. Word has length 156 [2022-04-15 11:50:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:34,901 INFO L478 AbstractCegarLoop]: Abstraction has 979 states and 1395 transitions. [2022-04-15 11:50:34,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:34,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 979 states and 1395 transitions. [2022-04-15 11:50:36,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1395 edges. 1395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1395 transitions. [2022-04-15 11:50:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-15 11:50:36,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:36,156 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:50:36,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 11:50:36,156 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1811231069, now seen corresponding path program 1 times [2022-04-15 11:50:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071571899] [2022-04-15 11:50:36,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:36,222 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:36,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1811231069, now seen corresponding path program 2 times [2022-04-15 11:50:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:36,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357279681] [2022-04-15 11:50:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:36,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {162704#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {162697#true} is VALID [2022-04-15 11:50:36,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {162697#true} assume true; {162697#true} is VALID [2022-04-15 11:50:36,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162697#true} {162697#true} #705#return; {162697#true} is VALID [2022-04-15 11:50:36,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {162697#true} call ULTIMATE.init(); {162704#(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-15 11:50:36,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {162704#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {162697#true} is VALID [2022-04-15 11:50:36,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {162697#true} assume true; {162697#true} is VALID [2022-04-15 11:50:36,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162697#true} {162697#true} #705#return; {162697#true} is VALID [2022-04-15 11:50:36,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {162697#true} call #t~ret161 := main(); {162697#true} is VALID [2022-04-15 11:50:36,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {162697#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {162697#true} is VALID [2022-04-15 11:50:36,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {162697#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L272 TraceCheckUtils]: 7: Hoare triple {162697#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {162697#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {162697#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {162697#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {162697#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {162697#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {162697#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {162697#true} assume !false; {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {162697#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {162697#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {162697#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {162697#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {162697#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {162697#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {162697#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {162697#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {162697#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {162697#true} assume 8464 == #t~mem55;havoc #t~mem55; {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {162697#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {162697#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {162697#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {162697#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {162697#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {162697#true} ~skip~0 := 0; {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {162697#true} assume !false; {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {162697#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {162697#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {162697#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {162697#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {162697#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {162697#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {162697#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {162697#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {162697#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {162697#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {162697#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {162697#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {162697#true} assume 8496 == #t~mem58;havoc #t~mem58; {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {162697#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {162697#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {162697#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {162697#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {162697#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {162697#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {162697#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {162697#true} ~skip~0 := 0; {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {162697#true} assume !false; {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {162697#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {162697#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {162697#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {162697#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {162697#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 59: Hoare triple {162697#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {162697#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {162697#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {162697#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,358 INFO L290 TraceCheckUtils]: 63: Hoare triple {162697#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {162697#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {162697#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {162697#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {162697#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {162697#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {162697#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 70: Hoare triple {162697#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {162697#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {162697#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {162697#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 74: Hoare triple {162697#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {162697#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {162697#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {162697#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 78: Hoare triple {162697#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {162697#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 80: Hoare triple {162697#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 81: Hoare triple {162697#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 82: Hoare triple {162697#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {162697#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {162697#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {162697#true} assume 8656 == #t~mem77;havoc #t~mem77; {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {162697#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 87: Hoare triple {162697#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {162697#true} is VALID [2022-04-15 11:50:36,360 INFO L290 TraceCheckUtils]: 88: Hoare triple {162697#true} assume !(10 == ~blastFlag~0); {162697#true} is VALID [2022-04-15 11:50:36,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {162697#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,362 INFO L290 TraceCheckUtils]: 90: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___10~0); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,362 INFO L290 TraceCheckUtils]: 91: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,362 INFO L290 TraceCheckUtils]: 92: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,362 INFO L290 TraceCheckUtils]: 93: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,363 INFO L290 TraceCheckUtils]: 94: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,363 INFO L290 TraceCheckUtils]: 95: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,363 INFO L290 TraceCheckUtils]: 96: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,364 INFO L290 TraceCheckUtils]: 97: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,364 INFO L290 TraceCheckUtils]: 98: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,364 INFO L290 TraceCheckUtils]: 99: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,365 INFO L290 TraceCheckUtils]: 100: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,365 INFO L290 TraceCheckUtils]: 101: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,365 INFO L290 TraceCheckUtils]: 102: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,366 INFO L290 TraceCheckUtils]: 103: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,366 INFO L290 TraceCheckUtils]: 104: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,366 INFO L290 TraceCheckUtils]: 105: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,367 INFO L290 TraceCheckUtils]: 106: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,367 INFO L290 TraceCheckUtils]: 107: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,367 INFO L290 TraceCheckUtils]: 108: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,367 INFO L290 TraceCheckUtils]: 109: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,368 INFO L290 TraceCheckUtils]: 110: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,368 INFO L290 TraceCheckUtils]: 111: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,368 INFO L290 TraceCheckUtils]: 112: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,369 INFO L290 TraceCheckUtils]: 113: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,369 INFO L290 TraceCheckUtils]: 114: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,369 INFO L290 TraceCheckUtils]: 115: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,370 INFO L290 TraceCheckUtils]: 116: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,370 INFO L290 TraceCheckUtils]: 117: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,370 INFO L290 TraceCheckUtils]: 118: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,371 INFO L290 TraceCheckUtils]: 119: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,371 INFO L290 TraceCheckUtils]: 120: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,371 INFO L290 TraceCheckUtils]: 121: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 122: Hoare triple {162702#(= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {162703#(= |ssl3_accept_#t~mem74| 8672)} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 123: Hoare triple {162703#(= |ssl3_accept_#t~mem74| 8672)} assume 8609 == #t~mem74;havoc #t~mem74; {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 124: Hoare triple {162698#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 125: Hoare triple {162698#false} assume !(8 == ~blastFlag~0); {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 126: Hoare triple {162698#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 127: Hoare triple {162698#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 128: Hoare triple {162698#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 129: Hoare triple {162698#false} ~skip~0 := 0; {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 130: Hoare triple {162698#false} assume !false; {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 131: Hoare triple {162698#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,372 INFO L290 TraceCheckUtils]: 132: Hoare triple {162698#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 133: Hoare triple {162698#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 134: Hoare triple {162698#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 135: Hoare triple {162698#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 136: Hoare triple {162698#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 137: Hoare triple {162698#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 138: Hoare triple {162698#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 139: Hoare triple {162698#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 140: Hoare triple {162698#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 141: Hoare triple {162698#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 142: Hoare triple {162698#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 143: Hoare triple {162698#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 144: Hoare triple {162698#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 145: Hoare triple {162698#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 146: Hoare triple {162698#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,373 INFO L290 TraceCheckUtils]: 147: Hoare triple {162698#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 148: Hoare triple {162698#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 149: Hoare triple {162698#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 150: Hoare triple {162698#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 151: Hoare triple {162698#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 152: Hoare triple {162698#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 153: Hoare triple {162698#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 154: Hoare triple {162698#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 155: Hoare triple {162698#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 156: Hoare triple {162698#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 157: Hoare triple {162698#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 158: Hoare triple {162698#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 159: Hoare triple {162698#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 160: Hoare triple {162698#false} assume 8640 == #t~mem75;havoc #t~mem75; {162698#false} is VALID [2022-04-15 11:50:36,374 INFO L290 TraceCheckUtils]: 161: Hoare triple {162698#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {162698#false} is VALID [2022-04-15 11:50:36,375 INFO L290 TraceCheckUtils]: 162: Hoare triple {162698#false} assume !(9 == ~blastFlag~0); {162698#false} is VALID [2022-04-15 11:50:36,375 INFO L290 TraceCheckUtils]: 163: Hoare triple {162698#false} assume !false; {162698#false} is VALID [2022-04-15 11:50:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 11:50:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:36,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357279681] [2022-04-15 11:50:36,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357279681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:36,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:36,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:36,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:36,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2071571899] [2022-04-15 11:50:36,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2071571899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:36,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:36,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:36,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537449568] [2022-04-15 11:50:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:36,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2022-04-15 11:50:36,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:36,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:36,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:36,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:36,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:36,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:36,465 INFO L87 Difference]: Start difference. First operand 979 states and 1395 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:39,394 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-15 11:50:41,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:44,802 INFO L93 Difference]: Finished difference Result 2089 states and 2982 transitions. [2022-04-15 11:50:44,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:44,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2022-04-15 11:50:44,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-04-15 11:50:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-04-15 11:50:44,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 534 transitions. [2022-04-15 11:50:45,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 534 edges. 534 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:45,167 INFO L225 Difference]: With dead ends: 2089 [2022-04-15 11:50:45,167 INFO L226 Difference]: Without dead ends: 1136 [2022-04-15 11:50:45,168 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:45,168 INFO L913 BasicCegarLoop]: 228 mSDtfsCounter, 65 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:45,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 572 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:50:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-04-15 11:50:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1055. [2022-04-15 11:50:45,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:45,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1136 states. Second operand has 1055 states, 1050 states have (on average 1.4276190476190476) internal successors, (1499), 1050 states have internal predecessors, (1499), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:45,233 INFO L74 IsIncluded]: Start isIncluded. First operand 1136 states. Second operand has 1055 states, 1050 states have (on average 1.4276190476190476) internal successors, (1499), 1050 states have internal predecessors, (1499), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:45,234 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand has 1055 states, 1050 states have (on average 1.4276190476190476) internal successors, (1499), 1050 states have internal predecessors, (1499), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:45,269 INFO L93 Difference]: Finished difference Result 1136 states and 1615 transitions. [2022-04-15 11:50:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1615 transitions. [2022-04-15 11:50:45,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:45,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:45,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 1055 states, 1050 states have (on average 1.4276190476190476) internal successors, (1499), 1050 states have internal predecessors, (1499), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1136 states. [2022-04-15 11:50:45,271 INFO L87 Difference]: Start difference. First operand has 1055 states, 1050 states have (on average 1.4276190476190476) internal successors, (1499), 1050 states have internal predecessors, (1499), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1136 states. [2022-04-15 11:50:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:45,306 INFO L93 Difference]: Finished difference Result 1136 states and 1615 transitions. [2022-04-15 11:50:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1615 transitions. [2022-04-15 11:50:45,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:45,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:45,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:45,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1050 states have (on average 1.4276190476190476) internal successors, (1499), 1050 states have internal predecessors, (1499), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1503 transitions. [2022-04-15 11:50:45,354 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1503 transitions. Word has length 164 [2022-04-15 11:50:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:45,355 INFO L478 AbstractCegarLoop]: Abstraction has 1055 states and 1503 transitions. [2022-04-15 11:50:45,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:45,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1055 states and 1503 transitions. [2022-04-15 11:50:46,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1503 edges. 1503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1503 transitions. [2022-04-15 11:50:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-15 11:50:46,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:46,755 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:46,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 11:50:46,756 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1790268022, now seen corresponding path program 1 times [2022-04-15 11:50:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:46,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894401016] [2022-04-15 11:50:46,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:46,856 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:46,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1790268022, now seen corresponding path program 2 times [2022-04-15 11:50:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:46,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081357141] [2022-04-15 11:50:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:46,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:47,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {171278#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {171269#true} is VALID [2022-04-15 11:50:47,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {171269#true} assume true; {171269#true} is VALID [2022-04-15 11:50:47,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171269#true} {171269#true} #705#return; {171269#true} is VALID [2022-04-15 11:50:47,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {171269#true} call ULTIMATE.init(); {171278#(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-15 11:50:47,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {171278#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {171269#true} is VALID [2022-04-15 11:50:47,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {171269#true} assume true; {171269#true} is VALID [2022-04-15 11:50:47,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171269#true} {171269#true} #705#return; {171269#true} is VALID [2022-04-15 11:50:47,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {171269#true} call #t~ret161 := main(); {171269#true} is VALID [2022-04-15 11:50:47,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {171269#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {171269#true} is VALID [2022-04-15 11:50:47,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {171269#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {171274#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-15 11:50:47,186 INFO L272 TraceCheckUtils]: 7: Hoare triple {171274#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {171275#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-15 11:50:47,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {171275#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {171276#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-15 11:50:47,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {171276#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {171276#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-15 11:50:47,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {171276#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {171276#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-15 11:50:47,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {171276#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {171276#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {171276#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {171277#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {171277#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {171270#false} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {171270#false} assume !false; {171270#false} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {171270#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {171270#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {171270#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {171270#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {171270#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {171270#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {171270#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {171270#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {171270#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {171270#false} assume 8464 == #t~mem55;havoc #t~mem55; {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {171270#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {171270#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {171270#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {171270#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {171270#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {171270#false} ~skip~0 := 0; {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {171270#false} assume !false; {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {171270#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {171270#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {171270#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {171270#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {171270#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {171270#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {171270#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {171270#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {171270#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {171270#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {171270#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 43: Hoare triple {171270#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {171270#false} assume 8496 == #t~mem58;havoc #t~mem58; {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {171270#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {171270#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {171270#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {171270#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {171270#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {171270#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {171270#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {171270#false} ~skip~0 := 0; {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {171270#false} assume !false; {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {171270#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {171270#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 56: Hoare triple {171270#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {171270#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {171270#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 59: Hoare triple {171270#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {171270#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {171270#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {171270#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {171270#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {171270#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {171270#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 66: Hoare triple {171270#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 67: Hoare triple {171270#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 68: Hoare triple {171270#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 69: Hoare triple {171270#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 70: Hoare triple {171270#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 71: Hoare triple {171270#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 72: Hoare triple {171270#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 73: Hoare triple {171270#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {171270#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 75: Hoare triple {171270#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 76: Hoare triple {171270#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 77: Hoare triple {171270#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,194 INFO L290 TraceCheckUtils]: 78: Hoare triple {171270#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 79: Hoare triple {171270#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 80: Hoare triple {171270#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 81: Hoare triple {171270#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 82: Hoare triple {171270#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 83: Hoare triple {171270#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 84: Hoare triple {171270#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 85: Hoare triple {171270#false} assume 8656 == #t~mem77;havoc #t~mem77; {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 86: Hoare triple {171270#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 87: Hoare triple {171270#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 88: Hoare triple {171270#false} assume !(10 == ~blastFlag~0); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 89: Hoare triple {171270#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 90: Hoare triple {171270#false} assume !(0 == ~tmp___10~0); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 91: Hoare triple {171270#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,195 INFO L290 TraceCheckUtils]: 92: Hoare triple {171270#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 93: Hoare triple {171270#false} ~skip~0 := 0; {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 94: Hoare triple {171270#false} assume !false; {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 95: Hoare triple {171270#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 96: Hoare triple {171270#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 97: Hoare triple {171270#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 98: Hoare triple {171270#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 99: Hoare triple {171270#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 100: Hoare triple {171270#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 101: Hoare triple {171270#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 102: Hoare triple {171270#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 103: Hoare triple {171270#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 104: Hoare triple {171270#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 105: Hoare triple {171270#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 106: Hoare triple {171270#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,196 INFO L290 TraceCheckUtils]: 107: Hoare triple {171270#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 108: Hoare triple {171270#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 109: Hoare triple {171270#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 110: Hoare triple {171270#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 111: Hoare triple {171270#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 112: Hoare triple {171270#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 113: Hoare triple {171270#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 114: Hoare triple {171270#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 115: Hoare triple {171270#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 116: Hoare triple {171270#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 117: Hoare triple {171270#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 118: Hoare triple {171270#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 119: Hoare triple {171270#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 120: Hoare triple {171270#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 121: Hoare triple {171270#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,197 INFO L290 TraceCheckUtils]: 122: Hoare triple {171270#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 123: Hoare triple {171270#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 124: Hoare triple {171270#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 125: Hoare triple {171270#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 126: Hoare triple {171270#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 127: Hoare triple {171270#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 128: Hoare triple {171270#false} assume 8672 == #t~mem79;havoc #t~mem79; {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 129: Hoare triple {171270#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 130: Hoare triple {171270#false} assume !(11 == ~blastFlag~0); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 131: Hoare triple {171270#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 132: Hoare triple {171270#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 133: Hoare triple {171270#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 134: Hoare triple {171270#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,198 INFO L290 TraceCheckUtils]: 135: Hoare triple {171270#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 136: Hoare triple {171270#false} ~skip~0 := 0; {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 137: Hoare triple {171270#false} assume !false; {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 138: Hoare triple {171270#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 139: Hoare triple {171270#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 140: Hoare triple {171270#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 141: Hoare triple {171270#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 142: Hoare triple {171270#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 143: Hoare triple {171270#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 144: Hoare triple {171270#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 145: Hoare triple {171270#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 146: Hoare triple {171270#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 147: Hoare triple {171270#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 148: Hoare triple {171270#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,199 INFO L290 TraceCheckUtils]: 149: Hoare triple {171270#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 150: Hoare triple {171270#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 151: Hoare triple {171270#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 152: Hoare triple {171270#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 153: Hoare triple {171270#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 154: Hoare triple {171270#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 155: Hoare triple {171270#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 156: Hoare triple {171270#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 157: Hoare triple {171270#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 158: Hoare triple {171270#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 159: Hoare triple {171270#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 160: Hoare triple {171270#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 161: Hoare triple {171270#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 162: Hoare triple {171270#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 163: Hoare triple {171270#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,200 INFO L290 TraceCheckUtils]: 164: Hoare triple {171270#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,201 INFO L290 TraceCheckUtils]: 165: Hoare triple {171270#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,201 INFO L290 TraceCheckUtils]: 166: Hoare triple {171270#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {171270#false} is VALID [2022-04-15 11:50:47,201 INFO L290 TraceCheckUtils]: 167: Hoare triple {171270#false} assume 8640 == #t~mem75;havoc #t~mem75; {171270#false} is VALID [2022-04-15 11:50:47,201 INFO L290 TraceCheckUtils]: 168: Hoare triple {171270#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {171270#false} is VALID [2022-04-15 11:50:47,201 INFO L290 TraceCheckUtils]: 169: Hoare triple {171270#false} assume !(9 == ~blastFlag~0); {171270#false} is VALID [2022-04-15 11:50:47,201 INFO L290 TraceCheckUtils]: 170: Hoare triple {171270#false} assume !false; {171270#false} is VALID [2022-04-15 11:50:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-15 11:50:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:47,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081357141] [2022-04-15 11:50:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081357141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:47,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:50:47,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:47,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894401016] [2022-04-15 11:50:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894401016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:47,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:50:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108514961] [2022-04-15 11:50:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:47,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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 171 [2022-04-15 11:50:47,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:47,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-15 11:50:47,260 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-15 11:50:47,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 11:50:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:47,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 11:50:47,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:50:47,260 INFO L87 Difference]: Start difference. First operand 1055 states and 1503 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-15 11:50:49,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:51,795 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-15 11:50:57,179 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-15 11:51:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:00,552 INFO L93 Difference]: Finished difference Result 2103 states and 2998 transitions. [2022-04-15 11:51:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:51:00,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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 171 [2022-04-15 11:51:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-15 11:51:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 430 transitions. [2022-04-15 11:51:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-15 11:51:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 430 transitions. [2022-04-15 11:51:00,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 430 transitions. [2022-04-15 11:51:00,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:00,834 INFO L225 Difference]: With dead ends: 2103 [2022-04-15 11:51:00,835 INFO L226 Difference]: Without dead ends: 1055 [2022-04-15 11:51:00,836 INFO L912 BasicCegarLoop]: 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-15 11:51:00,836 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:00,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 861 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 447 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2022-04-15 11:51:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-04-15 11:51:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2022-04-15 11:51:00,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:00,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1055 states. Second operand has 1055 states, 1050 states have (on average 1.4266666666666667) internal successors, (1498), 1050 states have internal predecessors, (1498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:00,930 INFO L74 IsIncluded]: Start isIncluded. First operand 1055 states. Second operand has 1055 states, 1050 states have (on average 1.4266666666666667) internal successors, (1498), 1050 states have internal predecessors, (1498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:00,930 INFO L87 Difference]: Start difference. First operand 1055 states. Second operand has 1055 states, 1050 states have (on average 1.4266666666666667) internal successors, (1498), 1050 states have internal predecessors, (1498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:00,961 INFO L93 Difference]: Finished difference Result 1055 states and 1502 transitions. [2022-04-15 11:51:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1502 transitions. [2022-04-15 11:51:00,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:00,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:00,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 1055 states, 1050 states have (on average 1.4266666666666667) internal successors, (1498), 1050 states have internal predecessors, (1498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1055 states. [2022-04-15 11:51:00,963 INFO L87 Difference]: Start difference. First operand has 1055 states, 1050 states have (on average 1.4266666666666667) internal successors, (1498), 1050 states have internal predecessors, (1498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1055 states. [2022-04-15 11:51:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:00,994 INFO L93 Difference]: Finished difference Result 1055 states and 1502 transitions. [2022-04-15 11:51:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1502 transitions. [2022-04-15 11:51:00,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:00,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:00,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:00,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1050 states have (on average 1.4266666666666667) internal successors, (1498), 1050 states have internal predecessors, (1498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1502 transitions. [2022-04-15 11:51:01,046 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1502 transitions. Word has length 171 [2022-04-15 11:51:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:01,046 INFO L478 AbstractCegarLoop]: Abstraction has 1055 states and 1502 transitions. [2022-04-15 11:51:01,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-15 11:51:01,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1055 states and 1502 transitions. [2022-04-15 11:51:02,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1502 edges. 1502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1502 transitions. [2022-04-15 11:51:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-15 11:51:02,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:02,483 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:02,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 11:51:02,483 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash -132982408, now seen corresponding path program 1 times [2022-04-15 11:51:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:02,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [104761706] [2022-04-15 11:51:02,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:02,564 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:02,564 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -132982408, now seen corresponding path program 2 times [2022-04-15 11:51:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:02,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690196136] [2022-04-15 11:51:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:03,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {179726#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {179713#true} is VALID [2022-04-15 11:51:03,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {179713#true} assume true; {179713#true} is VALID [2022-04-15 11:51:03,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179713#true} {179713#true} #705#return; {179713#true} is VALID [2022-04-15 11:51:03,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {179713#true} call ULTIMATE.init(); {179726#(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-15 11:51:03,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {179726#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {179713#true} is VALID [2022-04-15 11:51:03,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {179713#true} assume true; {179713#true} is VALID [2022-04-15 11:51:03,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179713#true} {179713#true} #705#return; {179713#true} is VALID [2022-04-15 11:51:03,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {179713#true} call #t~ret161 := main(); {179713#true} is VALID [2022-04-15 11:51:03,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {179713#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {179718#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 84)) main_~s~0.base)) (= (select |#valid| main_~s~0.base) 1) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} is VALID [2022-04-15 11:51:03,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {179718#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 84)) main_~s~0.base)) (= (select |#valid| main_~s~0.base) 1) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {179719#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 84)) main_~s~0.base)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} is VALID [2022-04-15 11:51:03,497 INFO L272 TraceCheckUtils]: 7: Hoare triple {179719#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 84)) main_~s~0.base)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {179720#(and (not (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) |ssl3_accept_#in~s.base|)) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)))))} is VALID [2022-04-15 11:51:03,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {179720#(and (not (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) |ssl3_accept_#in~s.base|)) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8464 == #t~mem55;havoc #t~mem55; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} ~skip~0 := 0; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8496 == #t~mem58;havoc #t~mem58; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} ~skip~0 := 0; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,524 INFO L290 TraceCheckUtils]: 59: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,527 INFO L290 TraceCheckUtils]: 67: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,528 INFO L290 TraceCheckUtils]: 69: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,532 INFO L290 TraceCheckUtils]: 78: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,533 INFO L290 TraceCheckUtils]: 79: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,533 INFO L290 TraceCheckUtils]: 80: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,534 INFO L290 TraceCheckUtils]: 81: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,534 INFO L290 TraceCheckUtils]: 82: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,535 INFO L290 TraceCheckUtils]: 83: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,535 INFO L290 TraceCheckUtils]: 84: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,536 INFO L290 TraceCheckUtils]: 85: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8656 == #t~mem77;havoc #t~mem77; {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-15 11:51:03,536 INFO L290 TraceCheckUtils]: 86: Hoare triple {179721#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,536 INFO L290 TraceCheckUtils]: 87: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,537 INFO L290 TraceCheckUtils]: 88: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(10 == ~blastFlag~0); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,538 INFO L290 TraceCheckUtils]: 89: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,538 INFO L290 TraceCheckUtils]: 90: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(0 == ~tmp___10~0); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,538 INFO L290 TraceCheckUtils]: 91: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,539 INFO L290 TraceCheckUtils]: 92: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} ~skip~0 := 0; {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,539 INFO L290 TraceCheckUtils]: 94: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !false; {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,540 INFO L290 TraceCheckUtils]: 95: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,540 INFO L290 TraceCheckUtils]: 96: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,540 INFO L290 TraceCheckUtils]: 97: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,541 INFO L290 TraceCheckUtils]: 98: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,541 INFO L290 TraceCheckUtils]: 99: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,541 INFO L290 TraceCheckUtils]: 100: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,542 INFO L290 TraceCheckUtils]: 101: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,542 INFO L290 TraceCheckUtils]: 102: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,542 INFO L290 TraceCheckUtils]: 103: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,543 INFO L290 TraceCheckUtils]: 104: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,543 INFO L290 TraceCheckUtils]: 105: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,543 INFO L290 TraceCheckUtils]: 106: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,544 INFO L290 TraceCheckUtils]: 107: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,544 INFO L290 TraceCheckUtils]: 108: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,544 INFO L290 TraceCheckUtils]: 109: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,545 INFO L290 TraceCheckUtils]: 110: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,545 INFO L290 TraceCheckUtils]: 111: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,545 INFO L290 TraceCheckUtils]: 112: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,546 INFO L290 TraceCheckUtils]: 113: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,546 INFO L290 TraceCheckUtils]: 114: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,546 INFO L290 TraceCheckUtils]: 115: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,547 INFO L290 TraceCheckUtils]: 116: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,547 INFO L290 TraceCheckUtils]: 117: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,547 INFO L290 TraceCheckUtils]: 118: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,548 INFO L290 TraceCheckUtils]: 119: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,548 INFO L290 TraceCheckUtils]: 120: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,549 INFO L290 TraceCheckUtils]: 121: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,549 INFO L290 TraceCheckUtils]: 122: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,549 INFO L290 TraceCheckUtils]: 123: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,550 INFO L290 TraceCheckUtils]: 124: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,550 INFO L290 TraceCheckUtils]: 125: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,550 INFO L290 TraceCheckUtils]: 126: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,551 INFO L290 TraceCheckUtils]: 127: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,551 INFO L290 TraceCheckUtils]: 128: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume 8672 == #t~mem79;havoc #t~mem79; {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,551 INFO L290 TraceCheckUtils]: 129: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,552 INFO L290 TraceCheckUtils]: 130: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(11 == ~blastFlag~0); {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} is VALID [2022-04-15 11:51:03,552 INFO L290 TraceCheckUtils]: 131: Hoare triple {179722#(not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))))} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {179723#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:03,553 INFO L290 TraceCheckUtils]: 132: Hoare triple {179723#(and (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))) (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,553 INFO L290 TraceCheckUtils]: 133: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,554 INFO L290 TraceCheckUtils]: 134: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,554 INFO L290 TraceCheckUtils]: 135: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,554 INFO L290 TraceCheckUtils]: 136: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,555 INFO L290 TraceCheckUtils]: 137: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,555 INFO L290 TraceCheckUtils]: 138: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,555 INFO L290 TraceCheckUtils]: 139: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,556 INFO L290 TraceCheckUtils]: 140: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,556 INFO L290 TraceCheckUtils]: 141: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,556 INFO L290 TraceCheckUtils]: 142: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,557 INFO L290 TraceCheckUtils]: 143: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,557 INFO L290 TraceCheckUtils]: 144: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,557 INFO L290 TraceCheckUtils]: 145: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,558 INFO L290 TraceCheckUtils]: 146: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,558 INFO L290 TraceCheckUtils]: 147: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,558 INFO L290 TraceCheckUtils]: 148: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,559 INFO L290 TraceCheckUtils]: 149: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,559 INFO L290 TraceCheckUtils]: 150: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,559 INFO L290 TraceCheckUtils]: 151: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,560 INFO L290 TraceCheckUtils]: 152: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,560 INFO L290 TraceCheckUtils]: 153: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,560 INFO L290 TraceCheckUtils]: 154: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,561 INFO L290 TraceCheckUtils]: 155: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,561 INFO L290 TraceCheckUtils]: 156: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,561 INFO L290 TraceCheckUtils]: 157: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,561 INFO L290 TraceCheckUtils]: 158: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:03,562 INFO L290 TraceCheckUtils]: 159: Hoare triple {179724#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {179725#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-15 11:51:03,562 INFO L290 TraceCheckUtils]: 160: Hoare triple {179725#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {179714#false} is VALID [2022-04-15 11:51:03,562 INFO L290 TraceCheckUtils]: 161: Hoare triple {179714#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {179714#false} is VALID [2022-04-15 11:51:03,562 INFO L290 TraceCheckUtils]: 162: Hoare triple {179714#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {179714#false} is VALID [2022-04-15 11:51:03,562 INFO L290 TraceCheckUtils]: 163: Hoare triple {179714#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {179714#false} is VALID [2022-04-15 11:51:03,562 INFO L290 TraceCheckUtils]: 164: Hoare triple {179714#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {179714#false} is VALID [2022-04-15 11:51:03,562 INFO L290 TraceCheckUtils]: 165: Hoare triple {179714#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {179714#false} is VALID [2022-04-15 11:51:03,563 INFO L290 TraceCheckUtils]: 166: Hoare triple {179714#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {179714#false} is VALID [2022-04-15 11:51:03,563 INFO L290 TraceCheckUtils]: 167: Hoare triple {179714#false} assume 8640 == #t~mem75;havoc #t~mem75; {179714#false} is VALID [2022-04-15 11:51:03,563 INFO L290 TraceCheckUtils]: 168: Hoare triple {179714#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {179714#false} is VALID [2022-04-15 11:51:03,563 INFO L290 TraceCheckUtils]: 169: Hoare triple {179714#false} assume !(9 == ~blastFlag~0); {179714#false} is VALID [2022-04-15 11:51:03,563 INFO L290 TraceCheckUtils]: 170: Hoare triple {179714#false} assume !false; {179714#false} is VALID [2022-04-15 11:51:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 11:51:03,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690196136] [2022-04-15 11:51:03,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690196136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:51:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99444598] [2022-04-15 11:51:03,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:51:03,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:51:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:51:03,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:51:03,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 11:51:20,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:51:20,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:51:20,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 209 conjunts are in the unsatisfiable core [2022-04-15 11:51:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:20,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:51:21,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 11:51:21,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 11:51:21,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 11:51:21,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 11:51:21,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-15 11:51:21,506 INFO L356 Elim1Store]: treesize reduction 1040, result has 8.0 percent of original size [2022-04-15 11:51:21,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 11485277 treesize of output 2496613 [2022-04-15 11:51:32,999 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 11:51:33,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 11:51:33,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 11:51:33,216 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_2 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:911) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:872) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:790) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:426) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:356) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 11:51:33,219 INFO L158 Benchmark]: Toolchain (without parser) took 451067.62ms. Allocated memory was 215.0MB in the beginning and 373.3MB in the end (delta: 158.3MB). Free memory was 163.2MB in the beginning and 188.6MB in the end (delta: -25.5MB). Peak memory consumption was 233.5MB. Max. memory is 8.0GB. [2022-04-15 11:51:33,219 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 215.0MB. Free memory is still 181.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:51:33,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.96ms. Allocated memory was 215.0MB in the beginning and 257.9MB in the end (delta: 43.0MB). Free memory was 162.9MB in the beginning and 210.1MB in the end (delta: -47.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 11:51:33,219 INFO L158 Benchmark]: Boogie Preprocessor took 112.75ms. Allocated memory is still 257.9MB. Free memory was 210.1MB in the beginning and 199.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 11:51:33,220 INFO L158 Benchmark]: RCFGBuilder took 1558.57ms. Allocated memory is still 257.9MB. Free memory was 199.6MB in the beginning and 105.3MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 8.0GB. [2022-04-15 11:51:33,220 INFO L158 Benchmark]: TraceAbstraction took 448882.73ms. Allocated memory was 257.9MB in the beginning and 373.3MB in the end (delta: 115.3MB). Free memory was 104.7MB in the beginning and 188.6MB in the end (delta: -83.9MB). Peak memory consumption was 132.3MB. Max. memory is 8.0GB. [2022-04-15 11:51:33,220 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.12ms. Allocated memory is still 215.0MB. Free memory is still 181.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 505.96ms. Allocated memory was 215.0MB in the beginning and 257.9MB in the end (delta: 43.0MB). Free memory was 162.9MB in the beginning and 210.1MB in the end (delta: -47.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 112.75ms. Allocated memory is still 257.9MB. Free memory was 210.1MB in the beginning and 199.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1558.57ms. Allocated memory is still 257.9MB. Free memory was 199.6MB in the beginning and 105.3MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 8.0GB. * TraceAbstraction took 448882.73ms. Allocated memory was 257.9MB in the beginning and 373.3MB in the end (delta: 115.3MB). Free memory was 104.7MB in the beginning and 188.6MB in the end (delta: -83.9MB). Peak memory consumption was 132.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_2: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 11:51:33,247 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...